The chromatic index of multigraphs that are nearly full

DOI10.1016/0012-365X(90)90325-CzbMath0696.05025OpenAlexW1988736474MaRDI QIDQ910411

Michael J. Plantholt, Shailesh K. Tipnis

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90325-c

zbMATH Keywords

multigraphchromatic indexproper edge colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Critical star multigraphs
• On the chromatic index of almost all graphs
• On Hamilton's ideals
• Edge-coloring of multigraphs: Recoloring technique
• A generalization of edge-coloring in graphs
• A generalization of Plantholt's theorem
• The NP-Completeness of Edge-Coloring
• Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on it
• The chromatic index of graphs of even order with many edges
• Some Theorems on Abstract Graphs
• All regular multigraphs of even order and high degree are 1-factorable

This page was built for publication: The chromatic index of multigraphs that are nearly full