scientific article; zbMATH DE number 1560509
From MaRDI portal
Publication:4527280
zbMath0955.05036MaRDI QIDQ4527280
Publication date: 4 February 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (21)
On a limit of the method of Tashkinov trees for edge-colouring ⋮ On a theorem of Goldberg ⋮ A Combined Logarithmic Bound on the Chromatic Index of Multigraphs ⋮ Hamiltonicity of edge-chromatic critical graphs ⋮ Double Vizing fans in critical class two graphs ⋮ Orientation‐based edge‐colorings and linear arboricity of multigraphs ⋮ Approximating the chromatic index of multigraphs ⋮ Tashkinov-trees: an annotated proof ⋮ Densities, Matchings, and Fractional Edge-Colorings ⋮ Graph edge coloring: a survey ⋮ Chromatic index determined by fractional chromatic index ⋮ Average degrees of edge-chromatic critical graphs ⋮ 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 ⋮ On characterizing Vizing's edge colouring bound ⋮ On Vizing's bound for the chromatic index of a multigraph ⋮ Structural properties of edge-chromatic critical multigraphs ⋮ A brief history of edge-colorings – with personal reminiscences
This page was built for publication:
