Applications of edge coloring of multigraphs to vertex coloring of graphs

DOI10.1016/0012-365X(89)90203-3zbMath0675.05027OpenAlexW2029287218MaRDI QIDQ1121898

Henry A. Kierstead

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(89)90203-3

zbMATH Keywords

multigraphchromatic numberchromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Claw-free graphs---a survey ⋮ Colouring squares of claw-free graphs ⋮ Colouring Squares of Claw-free Graphs

Cites Work

• On the chromatic index of multigraphs without large triangles
• The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\)
• Some applications of Vizing's theorem to vertex colorings of graphs
• Edge-coloring of multigraphs: Recoloring technique
• Graph Theory and Probability
• Note on Choudum's “chromatic bounds for a class of graphs”
• The NP-Completeness of Edge-Coloring
• CHROMATIC BOUNDS FOR A CLASS OF GRAPHS
• On edge-colorings of graphs.
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Multicoloring the incidentors of a weighted directed multigraph
• A Theorem on Coloring the Lines of a Network
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item