<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msup><mml:mrow><mml:mi>λ</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msup></mml:math>-Optimality of Bipartite Digraphs

Similar Works

Action	Title	Year	Authors
+ PDF Chat	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math>-saturated bipartite graphs	2014	Wenying Gan Dániel Korándi Benny Sudakov
+	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-factorization of complete bipartite graphs	2007	Jian Wang Beiliang Du
+	Paths in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:mrow><mml:mo>[</mml:mo><mml:mi>h</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math>-bipartite hypertournaments	2022	Hong Yang Jixiang Meng
+	Strong edge-coloring of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si5.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>Δ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-bipartite graphs	2015	Julien Bensmail Aurélie Lagoutte Petru Valicov
+	On the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:msup><mml:mrow><mml:mi>λ</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msup></mml:math>-optimality in graphs with odd girth <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:mi>g</mml:mi></mml:math> and even girth <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.gif" display…	2011	C. Balbuena P. García‐Vázquez Luis Montejano Julián Salas
+	Characterizing minimally <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>n</mml:mi></mml:math>-extendable bipartite graphs	2007	Dingjun Lou
+	On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e290" altimg="si371.svg"><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-Hamilton-connected graphs	2023	Tianjiao Dai Hao Li Qiancheng Ouyang Zeng-Xian Tian
+	The inclusion-free edge-colorings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e71" altimg="si11.svg"><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>Δ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-bipartite graphs	2022	Lily Chen Yanyi Li Xiangqian Zhou
+	Minimizing the number of edges in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:msub><mml:mrow><mml:mi mathvariant="script">C</mml:mi></mml:mrow><mml:mrow><mml:mo>≥</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math>-saturated graphs	2021	Yue Ma Xinmin Hou Doudou Hei Jun Gao
+	On the girth of the bipartite graph <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>D</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>q</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>	2014	Xiaoyan Cheng Wenbing Chen Yuansheng Tang
+	Extremal <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msub></mml:math>-free bipartite graphs	2006	J.C. Valenzuela C. Balbuena P. García‐Vázquez X. Marcote
+	On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.gif" display="inline" overflow="scroll"><mml:mn>1</mml:mn></mml:math>-improper <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si5.gif" display="inline" overflow="scroll"><mml:mn>2</mml:mn></mml:math>-coloring of sparse graphs	2013	O.V. Borodin Alexandr Kostochka Matthew Yancey
+	Minimum <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e132" altimg="si21.svg"><mml:mrow><mml:mi>t</mml:mi><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math>-saturation graphs	2022	Zhen He Mei Lu Zequn Lv
+	On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml3" display="inline" overflow="scroll" altimg="si1.gif"><mml:mi>v</mml:mi><mml:mi>e</mml:mi></mml:math>-degrees and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml4" display="inline" overflow="scroll" altimg="si4.gif"><mml:mi>e</mml:mi><mml:mi>v</mml:mi></mml:math>-degrees in graphs	2016	Mustapha Chellali Teresa W. Haynes Stephen T. Hedetniemi Thomas M. Lewis
+	Minimum <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>C</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math>-saturated graphs	2011	Zoltán Füredi Younjin Kim
+	Coloring <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e23" altimg="si13.svg"><mml:mi>k</mml:mi></mml:math>-partite sparse digraphs	2024	Ararat Harutyunyan Louisa Harutyunyan Narek Hovhannisyan
+	The<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:mi>k</mml:mi></mml:math>-independence number of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.svg"><mml:mi>t</mml:mi></mml:math>-connected graphs	2021	Zhonghua Li Baoyindureng Wu
+	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>m</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-radius of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-connected graphs	2008	Hao Li Jianping Li
+ PDF Chat	Improving the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-bound on the price of stability in undirected Shapley network design games	2014	Yann Disser Andreas Emil Feldmann Max Klimm Matúš Mihaľák
+	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e53" altimg="si11.svg"><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>m</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-graphs with maximum exponential second Zagreb index	2023	Lkhagva Buyantogtokh Batmend Horoldagva

Works That Cite This (1)

Action	Title	Year	Authors
+	Arc Fault Tolerance of Maximally Arc-Connected Networks Modeled By Digraphs	2018	Shuang Zhao Jixiang Meng

Works Cited by This (1)

Action	Title	Year	Authors
+	None	2006	Ken‐ichi Kawarabayashi Michael D. Plummer Akira Saito