Kierstead, H. A.; Kostochka, A. V.; McConvey, A. A sharp Dirac-Erdős type bound for large graphs. (English) Zbl 1390.05108 Comb. Probab. Comput. 27, No. 3, 387-397 (2018). MSC: 05C35 05C70 05C10 PDFBibTeX XMLCite \textit{H. A. Kierstead} et al., Comb. Probab. Comput. 27, No. 3, 387--397 (2018; Zbl 1390.05108) Full Text: DOI arXiv
Kierstead, H. A.; Kostocha, A. V.; Yeager, Elyse C. The \((2k-1)\)-connected multigraphs with at most \(k-1\) disjoint cycles. (English) Zbl 1399.05075 Combinatorica 37, No. 1, 77-86 (2017). MSC: 05C15 05C35 05C40 05C38 05C07 PDFBibTeX XMLCite \textit{H. A. Kierstead} et al., Combinatorica 37, No. 1, 77--86 (2017; Zbl 1399.05075) Full Text: DOI arXiv
Kierstead, H. A.; Kostochka, A. V.; Molla, T.; Yeager, E. C. Sharpening an ore-type version of the Corrádi-Hajnal theorem. (English) Zbl 1462.05143 Abh. Math. Semin. Univ. Hamb. 87, No. 2, 299-335 (2017). Reviewer: Vinayak Joshi (Pune) MSC: 05C15 05C35 05C40 05C07 PDFBibTeX XMLCite \textit{H. A. Kierstead} et al., Abh. Math. Semin. Univ. Hamb. 87, No. 2, 299--335 (2017; Zbl 1462.05143) Full Text: DOI
Kierstead, H. A.; Kostochka, A. V.; McConvey, A. Strengthening theorems of Dirac and Erdős on disjoint cycles. (English) Zbl 1368.05079 J. Graph Theory 85, No. 4, 788-802 (2017). MSC: 05C38 05C07 05C35 05C10 PDFBibTeX XMLCite \textit{H. A. Kierstead} et al., J. Graph Theory 85, No. 4, 788--802 (2017; Zbl 1368.05079) Full Text: DOI arXiv
Kierstead, H. A.; Kostochka, A. V.; Yeager, E. C. On the Corrádi-Hajnal theorem and a question of Dirac. (English) Zbl 1350.05072 J. Comb. Theory, Ser. B 122, 121-148 (2017). MSC: 05C38 05C70 05C15 05C07 05C35 PDFBibTeX XMLCite \textit{H. A. Kierstead} et al., J. Comb. Theory, Ser. B 122, 121--148 (2017; Zbl 1350.05072) Full Text: DOI arXiv
Czygrinow, Andrzej; DeBiasio, Louis; Kierstead, H. A.; Molla, Theodore An extension of the Hajnal-Szemerédi theorem to directed graphs. (English) Zbl 1371.05101 Comb. Probab. Comput. 24, No. 5, 754-773 (2015). MSC: 05C20 05C35 PDFBibTeX XMLCite \textit{A. Czygrinow} et al., Comb. Probab. Comput. 24, No. 5, 754--773 (2015; Zbl 1371.05101) Full Text: DOI arXiv
Kierstead, H. A.; Kostochka, A. V. A refinement of a result of Corrádi and Hajnal. (English) Zbl 1374.05091 Combinatorica 35, No. 4, 497-512 (2015). MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{H. A. Kierstead} and \textit{A. V. Kostochka}, Combinatorica 35, No. 4, 497--512 (2015; Zbl 1374.05091) Full Text: DOI
Czygrinow, Andrzej; Kierstead, H. A.; Molla, Theodore On directed versions of the Corrádi-Hajnal corollary. (English) Zbl 1297.05185 Eur. J. Comb. 42, 1-14 (2014). MSC: 05C70 05C35 05C07 05C20 PDFBibTeX XMLCite \textit{A. Czygrinow} et al., Eur. J. Comb. 42, 1--14 (2014; Zbl 1297.05185) Full Text: DOI arXiv
Fan, Hao; Kierstead, H. A.; Liu, Guizhen; Molla, Theodore; Wu, Jian-Liang; Zhang, Xin A note on relaxed equitable coloring of graphs. (English) Zbl 1260.05057 Inf. Process. Lett. 111, No. 21-22, 1062-1066 (2011). MSC: 05C15 05C85 PDFBibTeX XMLCite \textit{H. Fan} et al., Inf. Process. Lett. 111, No. 21--22, 1062--1066 (2011; Zbl 1260.05057) Full Text: DOI
Kierstead, H. A.; Kostochka, A. V. Ore-type versions of Brooks’ theorem. (English) Zbl 1198.05059 J. Comb. Theory, Ser. B 99, No. 2, 298-305 (2009). MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{H. A. Kierstead} and \textit{A. V. Kostochka}, J. Comb. Theory, Ser. B 99, No. 2, 298--305 (2009; Zbl 1198.05059) Full Text: DOI
Kierstead, H. A.; Kostochka, A. V. An Ore-type theorem on equitable coloring. (English) Zbl 1127.05039 J. Comb. Theory, Ser. B 98, No. 1, 226-234 (2008). MSC: 05C15 05C70 PDFBibTeX XMLCite \textit{H. A. Kierstead} and \textit{A. V. Kostochka}, J. Comb. Theory, Ser. B 98, No. 1, 226--234 (2008; Zbl 1127.05039) Full Text: DOI
Kierstead, H. A. The dimension of two levels of the Boolean lattice. (English) Zbl 0941.06004 Discrete Math. 201, No. 1-3, 141-155 (1999). Reviewer: Konrad Engel (Rostock) MSC: 06A07 05D05 06-02 PDFBibTeX XMLCite \textit{H. A. Kierstead}, Discrete Math. 201, No. 1--3, 141--155 (1999; Zbl 0941.06004) Full Text: DOI
Kierstead, H. A.; Rödl, Vojtěch Applications of hypergraph coloring to coloring graphs not inducing certain trees. (English) Zbl 0856.05039 Discrete Math. 150, No. 1-3, 187-193 (1996). Reviewer: K.Dohmen (Berlin) MSC: 05C15 05C65 05C05 PDFBibTeX XMLCite \textit{H. A. Kierstead} and \textit{V. Rödl}, Discrete Math. 150, No. 1--3, 187--193 (1996; Zbl 0856.05039) Full Text: DOI
Kierstead, H. A.; Trotter, W. T. Planar graph coloring with an uncooperative partner. (English) Zbl 0809.05044 J. Graph Theory 18, No. 6, 569-584 (1994). Reviewer: H.Bodlaender (Utrecht) MSC: 05C15 91A43 05C10 05C55 PDFBibTeX XMLCite \textit{H. A. Kierstead} and \textit{W. T. Trotter}, J. Graph Theory 18, No. 6, 569--584 (1994; Zbl 0809.05044) Full Text: DOI
Kierstead, H. A.; Penrice, S. G. Radius two trees specify \(\chi\)-bounded classes. (English) Zbl 0798.05023 J. Graph Theory 18, No. 2, 119-129 (1994). Reviewer: M.Frick (Pretoria) MSC: 05C15 05C05 05C35 PDFBibTeX XMLCite \textit{H. A. Kierstead} and \textit{S. G. Penrice}, J. Graph Theory 18, No. 2, 119--129 (1994; Zbl 0798.05023) Full Text: DOI
Kierstead, H. A.; Trotter, W. T. Colorful induced subgraphs. (English) Zbl 0765.05047 Discrete Math. 101, No. 1-3, 165-169 (1992). Reviewer: I.Tomescu (Bucureşti) MSC: 05C15 05C55 PDFBibTeX XMLCite \textit{H. A. Kierstead} and \textit{W. T. Trotter}, Discrete Math. 101, No. 1--3, 165--169 (1992; Zbl 0765.05047) Full Text: DOI