Graph edge colouring: Tashkinov trees and Goldberg's conjecture

DOI10.1016/J.JCTB.2009.04.001zbMath1210.05051OpenAlexW2032201799MaRDI QIDQ968455

Diego Scheide

Publication date: 5 May 2010

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2009.04.001

zbMATH Keywords

densitychromatic indexedge colouringTashkinov treeGoldberg's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (15)

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 ⋮ Efficiently list‐edge coloring multigraphs asymptotically optimally ⋮ Orientation‐based edge‐colorings and linear arboricity of multigraphs ⋮ Short Fans and the 5/6 Bound for Line Graphs ⋮ Graph edge coloring: a survey ⋮ Chromatic index determined by fractional chromatic index ⋮ Vizing's coloring algorithm and the fan number ⋮ Edge coloring multigraphs without small dense subsets ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotics of the chromatic index for multigraphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Edge-coloring of multigraphs: Recoloring technique
• On the $1.1$ Edge-Coloring of Multigraphs
• On edge-colorings of graphs.
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• A Theorem on Coloring the Lines of a Network

This page was built for publication: Graph edge colouring: Tashkinov trees and Goldberg's conjecture