Vizing's coloring algorithm and the fan number

DOI10.1002/jgt.20469zbMath1208.05031MaRDI QIDQ3055930

Michael Stiebitz, Diego Scheide

Publication date: 10 November 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20469

zbMATH Keywords

edge coloring; chromatic index

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph edge colouring: Tashkinov trees and Goldberg's conjecture
• On Vizing's bound for the chromatic index of a multigraph
• Critical star multigraphs
• An extension of Vizing's adjacency lemma of edge chromatic critical graphs
• Planar graphs of maximum degree seven are Class I
• Edge-coloring of multigraphs
• Note on the colouring of graphs
• Edge-coloring of multigraphs: Recoloring technique
• On the $1.1$ Edge-Coloring of Multigraphs
• A better than “best possible” algorithm to edge color multigraphs
• A note concerning the chromatic index of multigraphs
• The NP-Completeness of Edge-Coloring
• On edge-colorings of graphs.
• Two Isomorphs of the Four-Colour Problem
• Über eine von H. S. WILF angegebene Schranke für die chromatische Zahl endlicher Graphen
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• A Theorem on Coloring the Lines of a Network