Edge coloring regular graphs of high degree

A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

Herman Chernoff · The Annals of Mathematical Statistics · 1952 · 3.6K citations · Full text

Asymptotic Efficiency, Convenient Test, Engineering +9

Graph coloring problems

Choice Reviews Online · 1995 · 1.2K citations

Geometric Graph Theory, Graph Theory, Geometry +14

Regular Graphs of High Degree are 1-Factorizable

Amanda G. Chetwynd, A. J. W. Hilton · Proceedings of the London Mathematical Society · 1985 · 94 citations

Graph Minor, Regular Graph G, Geometric Graph Theory +9

Star multigraphs with three vertices of maximum degree

Amanda G. Chetwynd, A. J. W. Hilton · Mathematical Proceedings of the Cambridge Philosophical Society · 1986 · 82 citations

Geometric Graph Theory, Graph Theory, Star Multigraphs +10

1-factorizing regular graphs of high degree—an improved bound

Amanda G. Chetwynd, A. J. W. Hilton · Discrete Mathematics · 1989 · 59 citations

Graph Theory, Algebraic Graph Theory, Structural Graph Theory +3