Edge-coloring of multigraphs: Recoloring technique
From MaRDI portal
Publication:3216672
DOI10.1002/jgt.3190080115zbMath0554.05023MaRDI 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
Densities, Matchings, and Fractional Edge-Colorings, Improved bounds for the chromatic index of graphs and multigraphs, A Combined Logarithmic Bound on the Chromatic Index of Multigraphs, Short Fans and the 5/6 Bound for Line Graphs, A brief history of edge-colorings – with personal reminiscences, A note on Goldberg's conjecture on total chromatic numbers, Approximating the chromatic index of multigraphs, The chromatic index of multigraphs that are nearly full, An adjacency Lemma for critical multigraphs, Graph edge colouring: Tashkinov trees and Goldberg's conjecture, Achieving maximum chromatic index in multigraphs, A theorem in edge colouring, On Vizing's bound for the chromatic index of a multigraph, On the chromatic index of multigraphs and a conjecture of Seymour (I), Applications of edge coloring of multigraphs to vertex coloring of graphs, A sublinear bound on the chromatic index of multigraphs, On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs, Graph edge coloring: a survey, Chromatic index determined by fractional chromatic index, On the coequal values of total chromatic number and chromatic index, Goldberg's conjecture is true for random multigraphs, Structural properties of edge-chromatic critical multigraphs, A new tool for proving Vizing's theorem, Edge coloring multigraphs without small dense subsets, Using the minimum maximum flow degree to approximate the flow coloring problem, Vizing's coloring algorithm and the fan number, On a theorem of Goldberg
Cites Work
