Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
KIERSTEAD, H. A.
and
KOSTOCHKA, A. V.
2008.
A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring.
Combinatorics, Probability and Computing,
Vol. 17,
Issue. 2,
p.
265.
Kierstead, H.A.
and
Kostochka, A.V.
2008.
An Ore-type theorem on equitable coloring.
Journal of Combinatorial Theory, Series B,
Vol. 98,
Issue. 1,
p.
226.
Kierstead, H.A.
and
Kostochka, A.V.
2009.
Ore-type versions of Brooks' theorem.
Journal of Combinatorial Theory, Series B,
Vol. 99,
Issue. 2,
p.
298.
Kostochka, Alexandr V.
and
Yu, Gexin
2009.
Ore-type conditions implying 2-factors consisting of short cycles.
Discrete Mathematics,
Vol. 309,
Issue. 14,
p.
4762.
Czygrinow, Andrzej
DeBiasio, Louis
and
Kierstead, H. A.
2010.
2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees.
SIAM Journal on Discrete Mathematics,
Vol. 24,
Issue. 2,
p.
486.
Kierstead, Henry A.
Kostochka, Alexandr V.
Mydlarz, Marcelo
and
Szemerédi, Endre
2010.
A fast algorithm for equitable coloring.
Combinatorica,
Vol. 30,
Issue. 2,
p.
217.
GAO, WEI
and
ZHOU, FEN
2012.
A QUESTION ON RELAXED EQUITABLE COLORING.
Discrete Mathematics, Algorithms and Applications,
Vol. 04,
Issue. 03,
p.
1250042.
Kostochka, Alexandr V.
and
Yu, Gexin
2012.
Graphs Containing Every 2-Factor.
Graphs and Combinatorics,
Vol. 28,
Issue. 5,
p.
687.
Châu, Phong
2013.
An Ore-Type Theorem on Hamiltonian Square Cycles.
Graphs and Combinatorics,
Vol. 29,
Issue. 4,
p.
795.
Chiba, Shuya
and
Yamashita, Tomoki
2018.
Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey.
Graphs and Combinatorics,
Vol. 34,
Issue. 1,
p.
1.
Simonovits, Miklós
and
Szemerédi, Endre
2019.
Building Bridges II.
Vol. 28,
Issue. ,
p.
445.
Csaba, Béla
and
Nagy-György, Judit
2019.
Embedding Graphs Having Ore-Degree at Most Five.
SIAM Journal on Discrete Mathematics,
Vol. 33,
Issue. 1,
p.
474.