On a limit of the method of Tashkinov trees for edge-colouring

DOI10.1016/j.disc.2016.03.025zbMath1338.05072arXiv1604.07445OpenAlexW2350299420MaRDI QIDQ297916

John Asplund, Jessica McDonald

Publication date: 20 June 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.07445

zbMATH Keywords

multigraphsedge colouringdefective colourGoldberg-Seymour conjectureKempe changesTashkinov tree

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Densities, Matchings, and Fractional Edge-Colorings ⋮ Graph edge coloring: a survey ⋮ Structural properties of edge-chromatic critical multigraphs ⋮ A brief history of edge-colorings – with personal reminiscences

Cites Work

• On the chromatic index of multigraphs without large triangles
• Graph edge colouring: Tashkinov trees and Goldberg's conjecture
• Achieving maximum chromatic index in multigraphs
• Asymptotics of the chromatic index for multigraphs
• The NP-Completeness of Edge-Coloring
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Maximum matching and a polyhedron with 0,1-vertices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a limit of the method of Tashkinov trees for edge-colouring