Class one graphs

DOI10.1016/0095-8956(88)90046-9zbMath0659.05071OpenAlexW2029062644MaRDI QIDQ1112066

C. A. Rodger, D. G. Hoffman

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90046-9

zbMATH Keywords

classification of graphsedge-queuestructural characterization of simple graphs by certain subgraphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (10)

Total-colorings of complete multipartite graphs using amalgamations ⋮ 1-factorizing regular graphs of high degree - an improved bound ⋮ On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs ⋮ The total chromatic number of complete multipartite graphs with low deficiency ⋮ Improved bounds for the chromatic index of graphs and multigraphs ⋮ On evenly-equitable, balanced edge-colorings and related notions ⋮ Some graphs of class 1 for \(f\)-colorings ⋮ Graphs of \(f\)-class 1 ⋮ Equitable edge-colorings of simple graphs ⋮ A sufficient condition for equitable edge-colourings of simple graphs

Cites Work

• On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index
• Méthode et théorème général de coloration des aretes d'un multigraphe
• The NP-Completeness of Edge-Coloring
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Class one graphs