Journal of Combinatorial Theory Series B · 1997 · 180 citations · 6 references
Natural SciencesLiteratureCombinatoricsGraph ColoringGraph TheoryChromatic PolynomialsStrong Coloring
6
The strong chromatic index of a cubic graph is at most 10
Lars Andersen · Discrete Mathematics · 1992 · 150 citations
Induced matchings in cubic graphs
Peter Horák, Qing He, William T. Trotter · Journal of Graph Theory · 1993 · 139 citations
The maximum number of edges in 2K2-free graphs of bounded degree
Fan Chung, András Gyárfás, Zs. Tuza et al. · Discrete Mathematics · 1990 · 99 citations
Induced matchings in bipartite graphs
Ralph J. Faudree, András Gyárfás, R. H. Schelp et al. · Discrete Mathematics · 1989 · 97 citations