Hamiltonian path saturated graphs with small size

Tough graphs and hamiltonian circuits

Vašek Chvátal · Discrete Mathematics · 1973 · 617 citations

Natural Sciences, Mathematics, Physics +13

A method in graph theory

J. A. Bondy, Vašek Chvátal · Discrete Mathematics · 1976 · 422 citations

Computing, Computer Science, Mathematics +4

The $L(2,1)$-Labeling Problem on Graphs

Gerard J. Chang, David Kuo · SIAM Journal on Discrete Mathematics · 1996 · 371 citations

Natural Sciences, Computer Science, Mathematics +10

Infinite Families of Nontrivial Trivalent Graphs Which are not Tait Colorable

Rufus Isaacs · American Mathematical Monthly · 1975 · 225 citations

Natural Sciences, Mathematics, Combinatorics +6

Saturated graphs with minimal number of edges

L. Kászonyi, Zs. Tuza · Journal of Graph Theory · 1986 · 175 citations

Natural Sciences, Computer Science, Mathematics +7