| Year |
Citation |
Score |
| 2018 |
Kierstead HA, Kostochka AV, McConvey A. A Sharp Dirac–Erdős Type Bound for Large Graphs Combinatorics, Probability & Computing. 27: 387-397. DOI: 10.1017/S0963548318000020 |
0.511 |
|
| 2017 |
Kierstead H, Kostochka AV, Molla T, Yeager EC. Sharpening an Ore-type version of the Corrádi–Hajnal theorem Abhandlungen Aus Dem Mathematischen Seminar Der Universitat Hamburg. 87: 299-335. DOI: 10.1007/S12188-016-0168-8 |
0.563 |
|
| 2017 |
Kierstead HA, Kostochka AV, McConvey A. Strengthening theorems of Dirac and Erdős on disjoint cycles Journal of Graph Theory. 85: 788-802. DOI: 10.1002/Jgt.22106 |
0.332 |
|
| 2016 |
Kierstead HA, Salmon A, Wang R. On the choice number of complete multipartite graphs with part size four European Journal of Combinatorics. 58: 1-16. DOI: 10.1016/j.ejc.2016.05.001 |
0.374 |
|
| 2016 |
Kierstead HA, Smith DA, Trotter WT. First-fit coloring on interval graphs has performance ratio at least 5 European Journal of Combinatorics. 51: 236-254. DOI: 10.1016/J.Ejc.2015.05.015 |
0.523 |
|
| 2015 |
Czygrinow A, Debiasio L, Kierstead HA, Molla T. An Extension of the Hajnal-Szemerédi Theorem to Directed Graphs Combinatorics Probability and Computing. 24: 754-773. DOI: 10.1017/S0963548314000716 |
0.733 |
|
| 2015 |
Haxell PE, Kierstead HA. Edge coloring multigraphs without small dense subsets Discrete Mathematics. 338: 2502-2506. DOI: 10.1016/j.disc.2015.06.022 |
0.4 |
|
| 2015 |
Kierstead HA, Lidický B. On choosability with separation of planar graphs with lists of different sizes Discrete Mathematics. 338: 1779-1783. DOI: 10.1016/J.Disc.2015.01.008 |
0.547 |
|
| 2015 |
Kierstead HA, Kostochka AV, Yeager EC. The (2k-1)-connected multigraphs with at most k-1 disjoint cycles Combinatorica. DOI: 10.1007/S00493-015-3291-8 |
0.583 |
|
| 2014 |
Kierstead HA, Kostochka AV, Yeager EC. On the Corrádi-Hajnal theorem and a question of Dirac Journal of Combinatorial Theory. Series B. DOI: 10.1016/J.Jctb.2016.05.007 |
0.608 |
|
| 2014 |
Czygrinow A, Kierstead HA, Molla T. On directed versions of the Corrádi-Hajnal corollary European Journal of Combinatorics. 42: 1-14. DOI: 10.1016/J.Ejc.2014.05.006 |
0.423 |
|
| 2014 |
Kierstead HA, Kostochka AV. A refinement of a result of Corrádi and Hajnal Combinatorica. 35: 497-512. DOI: 10.1007/S00493-014-3059-6 |
0.544 |
|
| 2014 |
Kierstead HA, Saoub KR. Generalized dynamic storage allocation Discrete Mathematics and Theoretical Computer Science. 16: 253-262. |
0.372 |
|
| 2013 |
Kierstead HA, Smith ME. On first-fit coloring of ladder-free posets European Journal of Combinatorics. 34: 474-489. DOI: 10.1016/J.Ejc.2012.07.007 |
0.301 |
|
| 2013 |
Kierstead HA, Kostochka AV. Equitable list coloring of graphs with bounded degree Journal of Graph Theory. 74: 309-334. DOI: 10.1002/jgt.21710 |
0.477 |
|
| 2012 |
Kierstead HA, Yang CY, Yang D, Zhu X. Adapted game colouring of graphs European Journal of Combinatorics. 33: 435-445. DOI: 10.1016/j.ejc.2011.11.001 |
0.463 |
|
| 2012 |
Kierstead HA, Kostochka AV. Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring Journal of Graph Theory. 71: 31-48. DOI: 10.1002/Jgt.20630 |
0.452 |
|
| 2011 |
Fan H, Kierstead HA, Liu G, Molla T, Wu JL, Zhang X. A note on relaxed equitable coloring of graphs Information Processing Letters. 111: 1062-1066. DOI: 10.1016/j.ipl.2011.08.001 |
0.372 |
|
| 2011 |
Kierstead HA, Saoub KR. First-Fit coloring of bounded tolerance graphs Discrete Applied Mathematics. 159: 605-611. DOI: 10.1016/j.dam.2010.05.002 |
0.493 |
|
| 2011 |
Châu P, Debiasio L, Kierstead HA. Pósa's conjecture for graphs of order at least 2 × 108 Random Structures and Algorithms. 39: 507-525. DOI: 10.1002/Rsa.20376 |
0.724 |
|
| 2010 |
Czygrinow A, Debiasio L, Kierstead HA. 2-Factors of bipartite graphs with asymmetric minimum degrees Siam Journal On Discrete Mathematics. 24: 486-504. DOI: 10.1137/080739513 |
0.695 |
|
| 2010 |
Cushing W, Kierstead HA. Planar graphs are 1-relaxed, 4-choosable European Journal of Combinatorics. 31: 1385-1397. DOI: 10.1016/J.Ejc.2009.11.013 |
0.323 |
|
| 2010 |
Kierstead HA, Kostochka AV, Mydlarz M, Szemerédi E. A fast algorithm for equitable coloring Combinatorica. 30: 217-224. DOI: 10.1007/S00493-010-2483-5 |
0.47 |
|
| 2010 |
Kierstead HA, Kostochka AV. Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture Combinatorica. 30: 201-216. DOI: 10.1007/S00493-010-2420-7 |
0.437 |
|
| 2009 |
Kierstead HA, Kostochka AV. Efficient graph packing via game Colouring Combinatorics Probability and Computing. 18: 765-774. DOI: 10.1017/S0963548309009973 |
0.553 |
|
| 2009 |
Kierstead HA, Kostochka AV. Ore-type versions of Brooks' theorem Journal of Combinatorial Theory. Series B. 99: 298-305. DOI: 10.1016/j.jctb.2008.06.007 |
0.475 |
|
| 2009 |
Kierstead HA, Konjevod G. Coloring number and on-line Ramsey theory for graphs and hypergraphs Combinatorica. 29: 49-64. DOI: 10.1007/S00493-009-2264-1 |
0.372 |
|
| 2009 |
Kierstead HA, Kündgen A, Timmons C. Star coloring bipartite planar graphs Journal of Graph Theory. 60: 1-10. DOI: 10.1002/jgt.20342 |
0.398 |
|
| 2008 |
Kierstead HA, Kostochka AV. A short proof of the Hajnal-Szemerédi theorem on equitable colouring Combinatorics Probability and Computing. 17: 265-270. DOI: 10.1017/S0963548307008619 |
0.464 |
|
| 2008 |
Kierstead HA, Kostochka AV. An Ore-type theorem on equitable coloring Journal of Combinatorial Theory. Series B. 98: 226-234. DOI: 10.1016/j.jctb.2007.07.003 |
0.466 |
|
| 2008 |
Bartnicki T, Grytczuk JA, Kierstead HA. The game of arboricity Discrete Mathematics. 308: 1388-1393. DOI: 10.1016/j.disc.2007.07.066 |
0.503 |
|
| 2008 |
Yang D, Kierstead HA. Asymmetric marking games on line graphs Discrete Mathematics. 308: 1751-1755. DOI: 10.1016/J.Disc.2007.03.082 |
0.577 |
|
| 2008 |
Grytczuk JA, Kierstead HA, Prałlat P. On-line Ramsey numbers for paths and stars Discrete Mathematics and Theoretical Computer Science. 10: 63-74. |
0.41 |
|
| 2006 |
Kierstead HA. Weak acyclic coloring and asymmetric coloring games Discrete Mathematics. 306: 673-677. DOI: 10.1016/J.Disc.2004.07.042 |
0.518 |
|
| 2005 |
Kierstead HA, Yang D. Very asymmetric marking games Order. 22: 93-107. DOI: 10.1007/s11083-005-9012-y |
0.465 |
|
| 2004 |
Johnson JR, Kierstead HA. Explicit 2-Factorisations of the Odd Graph Order. 21: 19-27. PMID 15127970 DOI: 10.1007/S11083-004-3344-X |
0.544 |
|
| 2004 |
Grytczuk JA, Hałuszczak M, Kierstead HA. On-line Ramsey theory Electronic Journal of Combinatorics. 11: 1-10. DOI: 10.37236/1810 |
0.572 |
|
| 2004 |
Albertson MO, Chappell GG, Kierstead HA, Kündgen A, Ramamurthi R. Coloring with no $2$-Colored $P_4$'s Electronic Journal of Combinatorics. 11: 26. DOI: 10.37236/1779 |
0.468 |
|
| 2004 |
Kierstead HA, Zhu Y. Radius three trees in graphs with large chromatic number Siam Journal On Discrete Mathematics. 17: 571-581. DOI: 10.1137/S0895480198339869 |
0.465 |
|
| 2004 |
Dunn C, Kierstead HA. A simple competitive graph coloring algorithm III Journal of Combinatorial Theory. Series B. 92: 137-150. DOI: 10.1016/j.jctb.2004.03.010 |
0.457 |
|
| 2004 |
Dunn C, Kierstead HA. The Relaxed Game Chromatic Number of Outerplanar Graphs Journal of Graph Theory. 46: 69-78. DOI: 10.1002/jgt.10172 |
0.419 |
|
| 2004 |
Albertson MO, Chappell GG, Kierstead HA, Kündgen A, Ramamurthi R. Coloring with no 2-colored P 4's Electronic Journal of Combinatorics. 11. |
0.376 |
|
| 2003 |
Kierstead HA, Yang D. Orderings on graphs and game coloring number Order. 20: 255-264. DOI: 10.1023/B:ORDE.0000026489.93166.cb |
0.391 |
|
| 2002 |
Czygrinow A, Kierstead HA. 2-factors in dense bipartite graphs Discrete Mathematics. 257: 357-369. DOI: 10.1016/S0012-365X(02)00435-1 |
0.458 |
|
| 2002 |
Czygrinow A, Hurlbert G, Kierstead HA, Trotter WT. A note on graph pebbling Graphs and Combinatorics. 18: 219-225. DOI: 10.1007/S003730200015 |
0.406 |
|
| 2001 |
Kierstead HA, Trottet WT. Competitive colorings of oriented graphs Electronic Journal of Combinatorics. 8. DOI: 10.37236/1611 |
0.558 |
|
| 2001 |
Czygrinow A, Fan G, Hurlbert G, Kierstead HA, Trotter WT. Spanning trees of bounded degree Electronic Journal of Combinatorics. 8: 1-12. DOI: 10.37236/1577 |
0.573 |
|
| 2000 |
Kierstead HA. A Simple Competitive Graph Coloring Algorithm Journal of Combinatorial Theory. Series B. 78: 57-68. DOI: 10.1006/jctb.1999.1927 |
0.488 |
|
| 2000 |
Kierstead HA. Extending partial colorings of graphs Discrete Mathematics. 219: 145-152. |
0.402 |
|
| 1999 |
Kierstead HA, Sárközy GN, Selkow SM. On k-ordered Hamiltonian graphs Journal of Graph Theory. 32: 17-25. |
0.432 |
|
| 1999 |
Katona GY, Kierstead HA. Hamiltonian chains in hypergraphs Journal of Graph Theory. 30: 205-212. |
0.303 |
|
| 1999 |
Kierstead HA. The dimension of two levels of the Boolean lattice Discrete Mathematics. 201: 141-155. |
0.314 |
|
| 1998 |
Kierstead HA. Chapter 18 Recursive and on-line graph coloring Studies in Logic and the Foundations of Mathematics. 139: 1233-1269. DOI: 10.1016/S0049-237X(98)80051-7 |
0.492 |
|
| 1998 |
Kierstead HA. Coloring graphs on-line Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1442: 281-305. DOI: 10.1007/BFb0029574 |
0.385 |
|
| 1998 |
Kierstead HA. On-line coloring k-colorable graphs Israel Journal of Mathematics. 105: 93-104. DOI: 10.1007/Bf02780324 |
0.47 |
|
| 1998 |
Kierstead HA, Quintana J. Square Hamiltonian cycles in graphs with maximal 4-cliques Discrete Mathematics. 178: 81-92. |
0.528 |
|
| 1996 |
Kierstead HA, Zhu Y. Classes of graphs that exclude a tree and a clique and are not vertex Ramsey Combinatorica. 16: 493-504. DOI: 10.1007/Bf01271268 |
0.508 |
|
| 1996 |
Fan G, Kierstead HA. Hamiltonian square-paths Journal of Combinatorial Theory. Series B. 67: 167-182. DOI: 10.1006/jctb.1996.0039 |
0.483 |
|
| 1996 |
Kierstead HA, Kolossa K. On-line coloring of perfect graphs Combinatorica. 16: 479-491. |
0.486 |
|
| 1996 |
Fan G, Kierstead HA. Partitioning a Graph into Two Square-Cycles Journal of Graph Theory. 23: 241-256. |
0.427 |
|
| 1996 |
Kierstead HA. On the order dimension of 1-sets versus k-sets Journal of Combinatorial Theory. Series A. 73: 219-228. |
0.312 |
|
| 1996 |
Kierstead HA, Rodl V. Applications of hypergraph coloring to coloring graphs not inducing certain trees Discrete Mathematics. 150: 187-193. |
0.407 |
|
| 1995 |
Kierstead HA, Penrice SG, Trotter WT. On-Line and First-Fit Coloring of Graphs That Do Not Induce $P_5$ Siam Journal On Discrete Mathematics. 8: 485-498. DOI: 10.1137/S0895480191218861 |
0.568 |
|
| 1995 |
Kierstead HA, Qin J. Coloring interval graphs with first-fit Discrete Mathematics. 144: 47-57. DOI: 10.1016/0012-365X(94)00285-Q |
0.519 |
|
| 1995 |
Fan GH, Kierstead HA. The Square of Paths and Cycles Journal of Combinatorial Theory, Series B. 63: 55-64. DOI: 10.1006/jctb.1995.1005 |
0.499 |
|
| 1994 |
Kierstead HA, Penrice SG, Trotter WT. On-Line Coloring and Recursive Graph Theory Siam Journal On Discrete Mathematics. 7: 72-89. DOI: 10.1137/S0895480192224737 |
0.54 |
|
| 1994 |
Brightwell GR, Kierstead HA, Kostochka AV, Trotter WT. The dimension of suborders of the Boolean lattice Order. 11: 127-134. DOI: 10.1007/Bf01108597 |
0.308 |
|
| 1994 |
Kierstead HA, Penrice SG. Radius two trees specify k-bounded classes Journal of Graph Theory. 18: 119-129. DOI: 10.1002/Jgt.3190180203 |
0.534 |
|
| 1992 |
Kierstead HA, Trotter WT. Colorful induced subgraphs Discrete Mathematics. 101: 165-169. DOI: 10.1016/0012-365X(92)90600-K |
0.507 |
|
| 1992 |
Kierstead HA, Trotter WT, Qin J. The dimension of cycle-free orders Order. 9: 103-110. DOI: 10.1007/Bf00814403 |
0.34 |
|
| 1991 |
Kierstead HA. A polynomial time approximation algorithm for dynamic storage allocation Discrete Mathematics. 88: 231-237. DOI: 10.1016/0012-365X(91)90011-P |
0.333 |
|
| 1989 |
Kierstead HA, Nyikos PJ. Hypergraphs with finitely many isomorphism subtypes Transactions of the American Mathematical Society. 312: 699-718. DOI: 10.1090/S0002-9947-1989-0988883-8 |
0.412 |
|
| 1989 |
Kierstead HA. Applications of edge coloring of multigraphs to vertex coloring of graphs Discrete Mathematics. 74: 117-124. DOI: 10.1016/0012-365X(89)90203-3 |
0.519 |
|
| 1989 |
Kierstead HA, Penrice SG. Computing the dimension of N-free ordered sets is NP-complete Order. 6: 133-135. DOI: 10.1007/Bf02034331 |
0.37 |
|
| 1989 |
Kierstead HA, Trotter WT. The number of depth-first searches of an ordered set Order. 6: 295-303. DOI: 10.1007/Bf00563529 |
0.4 |
|
| 1988 |
Kierstead HA, Trotter WT. Explicit matchings in the middle levels of the Boolean lattice Order. 5: 163-171. DOI: 10.1007/Bf00337621 |
0.456 |
|
| 1988 |
Kierstead HA. A minimax theorem for chain complete ordered sets Order. 5: 75-83. DOI: 10.1007/Bf00143899 |
0.368 |
|
| 1987 |
Kierstead HA, Trotter WT. A Ramsey theoretic problem for finite ordered sets Discrete Mathematics. 63: 217-223. DOI: 10.1016/0012-365X(87)90009-4 |
0.305 |
|
| 1986 |
Kierstead HA, Schmerl JH. The chromatic number of graphs which induce neither K1,3 nor K5-e Discrete Mathematics. 58: 253-262. DOI: 10.1016/0012-365X(86)90142-1 |
0.522 |
|
| 1986 |
Kierstead HA. NP-Completeness results concerning greedy and super greedy linear extensions Order. 3: 123-134. DOI: 10.1007/Bf00390103 |
0.325 |
|
| 1985 |
Kierstead HA, Remmel JB. Degrees of indiscernibles in decidable models Transactions of the American Mathematical Society. 289: 41-57. DOI: 10.1090/S0002-9947-1985-0779051-X |
0.324 |
|
| 1985 |
Kierstead HA, Trotter WT. Inequalities for the greedy dimensions of ordered sets Order. 2: 145-164. DOI: 10.1007/Bf00334853 |
0.304 |
|
| 1984 |
Kierstead HA. On the chromatic index of multigraphs without large triangles Journal of Combinatorial Theory, Series B. 36: 156-160. DOI: 10.1016/0095-8956(84)90022-4 |
0.379 |
|
| 1984 |
Kierstead HA, Szemerédi E, Trotter WT. On coloring graphs with locally small chromatic number Combinatorica. 4: 183-185. DOI: 10.1007/Bf02579219 |
0.597 |
|
| 1984 |
Kierstead HA, McNulty GF, Trotter WT. A theory of recursive dimension for ordered sets Order. 1: 67-82. DOI: 10.1007/Bf00396274 |
0.384 |
|
| 1983 |
Kierstead HA. An effective version of hall's theorem Proceedings of the American Mathematical Society. 88: 124-128. DOI: 10.1090/S0002-9939-1983-0691291-0 |
0.431 |
|
| 1983 |
Kierstead HA, Schmerl JH. Some applications of Vizing's theorem to vertex colorings of graphs Discrete Mathematics. 45: 277-285. DOI: 10.1016/0012-365X(83)90043-2 |
0.524 |
|
| 1981 |
Kierstead HA. An effective version of dilwortits theorem Transactions of the American Mathematical Society. 268: 63-77. DOI: 10.1090/S0002-9947-1981-0628446-X |
0.446 |
|
| Show low-probability matches. |