Publication:4527280
From MaRDI portal
zbMath0955.05036MaRDI QIDQ4527280
Publication date: 4 February 2001
68Q25: Analysis of algorithms and problem complexity
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Densities, Matchings, and Fractional Edge-Colorings, A Combined Logarithmic Bound on the Chromatic Index of Multigraphs, A brief history of edge-colorings – with personal reminiscences, Double Vizing fans in critical class two graphs, Orientation‐based edge‐colorings and linear arboricity of multigraphs, On a limit of the method of Tashkinov trees for edge-colouring, Approximating the chromatic index of multigraphs, Graph edge colouring: Tashkinov trees and Goldberg's conjecture, Achieving maximum chromatic index in multigraphs, On Vizing's bound for the chromatic index of a multigraph, Graph edge coloring: a survey, Chromatic index determined by fractional chromatic index, Average degrees of edge-chromatic critical graphs, Hamiltonicity of edge-chromatic critical graphs, Goldberg's conjecture is true for random multigraphs, Structural properties of edge-chromatic critical multigraphs, Edge coloring multigraphs without small dense subsets, Vizing's coloring algorithm and the fan number, On characterizing Vizing's edge colouring bound, On a theorem of Goldberg
