Clique covering the edges of a locally cobipartite graph. Hamiltonian connected graphs involving forbidden subgraphs. On the upper line-distinguishing and upper harmonious chromatic numbers of a graph. Note on graphs without repeated cycle lengths.
Vertex colorings with a distance restriction.
Star-factors of tournaments. Note on Whitney's theorem for k -connected graphs. Intersections of longest cycles in k -connected graphs. 157-168 05C55 Tough enough chordal graphs are Hamiltonian. A class of edge critical 4-chromatic graphs.