Edge-coloring of multigraphs: Recoloring technique
From MaRDI portal
Publication:3216672
DOI10.1002/jgt.3190080115zbMath0554.05023OpenAlexW2064383783MaRDI QIDQ3216672
Publication date: 1984
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190080115
Related Items (28)
On the chromatic index of multigraphs and a conjecture of Seymour (I) ⋮ On a theorem of Goldberg ⋮ On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs ⋮ A Combined Logarithmic Bound on the Chromatic Index of Multigraphs ⋮ Applications of edge coloring of multigraphs to vertex coloring of graphs ⋮ Using the minimum maximum flow degree to approximate the flow coloring problem ⋮ A note on Goldberg's conjecture on total chromatic numbers ⋮ Short Fans and the 5/6 Bound for Line Graphs ⋮ Total colorings-a survey ⋮ Approximating the chromatic index of multigraphs ⋮ The chromatic index of multigraphs that are nearly full ⋮ Improved bounds for the chromatic index of graphs and multigraphs ⋮ Densities, Matchings, and Fractional Edge-Colorings ⋮ A new tool for proving Vizing's theorem ⋮ Graph edge coloring: a survey ⋮ An adjacency Lemma for critical multigraphs ⋮ Chromatic index determined by fractional chromatic index ⋮ Graph edge colouring: Tashkinov trees and Goldberg's conjecture ⋮ Vizing's coloring algorithm and the fan number ⋮ Edge coloring multigraphs without small dense subsets ⋮ Achieving maximum chromatic index in multigraphs ⋮ Goldberg's conjecture is true for random multigraphs ⋮ A theorem in edge colouring ⋮ On Vizing's bound for the chromatic index of a multigraph ⋮ A sublinear bound on the chromatic index of multigraphs ⋮ Structural properties of edge-chromatic critical multigraphs ⋮ On the coequal values of total chromatic number and chromatic index ⋮ A brief history of edge-colorings – with personal reminiscences
Cites Work
This page was built for publication: Edge-coloring of multigraphs: Recoloring technique
