Henry A. Kierstead - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2023

The list version of the Borodin-Kostochka conjecture for graphs with large maximum degreeIlkyoo Choi, Henry A. Kierstead, Landon Rabern. DM, 346(11):113300, November 2023. [doi]

Special issue in honour of Landon RabernBrian Rabern, Daniel W. Cranston, Henry A. Kierstead. DM, 346(11):113507, November 2023. [doi]

2021

Uniform orderings for generalized coloring numbersJan van den Heuvel, Henry A. Kierstead. ejc, 91:103214, 2021. [doi]

2017

On the Corrádi-Hajnal theorem and a question of DiracHenry A. Kierstead, Alexandr V. Kostochka, E. C. Yeager. JCT, 122:121-148, 2017. [doi]

The (2k-1)-connected multigraphs with at most k-1 disjoint cyclesHenry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager. combinatorica, 37(1):77-86, 2017. [doi]

2012

Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-ColoringHenry A. Kierstead, Alexandr V. Kostochka. jgt, 71(1):31-48, 2012. [doi]

2010

A fast algorithm for equitable coloringHenry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi. combinatorica, 30(2):217-224, 2010. [doi]

Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjectureHenry A. Kierstead, Alexandr V. Kostochka. combinatorica, 30(2):201-216, 2010. [doi]

2006

Weak acyclic coloring and asymmetric coloring gamesHenry A. Kierstead. DM, 306(7):673-677, 2006. [doi]

2004

Coloring with no 2-Colored P4 sMichael O. Albertson, Glenn G. Chappell, Henry A. Kierstead, André Kündgen, Radhika Ramamurthi. combinatorics, 11(1), 2004. [doi]

On-line Ramsey TheoryJaroslaw Grytczuk, Mariusz Haluszczak, Henry A. Kierstead. combinatorics, 11(1), 2004. [doi]

Explicit 2-Factorisations of the Odd GraphJ. Robert Johnson, Henry A. Kierstead. order, 21(1):19-27, 2004. [doi]

2002

2-factors in dense bipartite graphsAndrzej Czygrinow, Henry A. Kierstead. DM, 257(2-3):357-369, 2002. [doi]

2001

Spanning Trees of Bounded DegreeAndrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter. combinatorics, 8(1), 2001. [doi]

Competitive Colorings of Oriented GraphsHenry A. Kierstead, William T. Trotter. combinatorics, 8(2), 2001. [doi]

2000

On the choosability of complete multipartite graphs with part size threeHenry A. Kierstead. DM, 211:255-259, 2000. [doi]

Interval orders and dimensionHenry A. Kierstead, William T. Trotter. DM, 213(1-3):179-188, 2000. [doi]

1996

Hamiltonian Square-PathsGenghua Fan, Henry A. Kierstead. JCT, 67(2):167-182, 1996. [doi]

1995

The Square of Paths and CyclesGenghua Fan, Henry A. Kierstead. JCT, 63(1):55-64, 1995. [doi]

On-Line and First-Fit Coloring of Graphs That Do Not Induce P::5::Henry A. Kierstead, Stephen G. Penrice, William T. Trotter. siamdm, 8(4):485-498, 1995. [doi]

1994

Radius two trees specify χ-bounded classesHenry A. Kierstead, Stephen G. Penrice. jgt, 18(2):119-129, 1994. [doi]

On-Line Coloring and Recursive Graph TheoryHenry A. Kierstead, Stephen G. Penrice, William T. Trotter. siamdm, 7(1):72-89, 1994. [doi]

1991

The Dimension of Random Ordered SetsPaul Erdös, Henry A. Kierstead, William T. Trotter. rsa, 2(3):254-276, 1991.

1987

On pi::1::-Automorphism of Recursive Linear OrdersHenry A. Kierstead. JSYML, 52(3):681-688, 1987.

1986

The chromatic number of graphs which induce neither K::1, 3:: nor K::5::-eHenry A. Kierstead, James H. Schmerl. DM, 58(3):253-262, 1986. [doi]

1984

On the chromatic index of multigraphs without large trianglesHenry A. Kierstead. JCT, 36(2):156-160, 1984. [doi]

On coloring graphs with locally small chromatic numberHenry A. Kierstead, Endre Szemerédi, William T. Trotter. combinatorica, 4(2):183-185, 1984.

1983

Indiscernibles and Decidable ModelsHenry A. Kierstead, Jeffrey B. Remmel. JSYML, 48(1):21-32, 1983.

Some applications of Vizing s theorem to vertex colorings of graphsHenry A. Kierstead, James H. Schmerl. DM, 45(2-3):277-285, 1983. [doi]

Sign in or sign up to see more results.

runs on WebDSL