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

DOI10.1016/J.DISC.2016.03.025zbMATH Open1338.05072arXiv1604.07445OpenAlexW2350299420MaRDI QIDQ297916FDOQ297916

Authors: John Asplund, Jessica McDonald 

Publication date: 20 June 2016

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

Abstract: The main technique used to edge-colour graphs requiring $Delta+2$ or more colours is the method of Tashkinov trees. We present a specific limit to this method, in terms of Kempe changes. We also provide a new Tashkinov tree extension.

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

Recommendations

• Graph edge colouring: Tashkinov trees and Goldberg's conjecture
• Structural properties of edge-chromatic critical multigraphs
• Edge-coloring of multigraphs: Recoloring technique
• Edge precoloring extension of trees
• Graph edge coloring: a survey

zbMATH Keywords

edge colouringmultigraphsdefective colourGoldberg-Seymour conjectureKempe changesTashkinov tree

Mathematics Subject Classification ID

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

Cites Work

• The NP-Completeness of Edge-Coloring
• Maximum matching and a polyhedron with 0,1-vertices
• Achieving maximum chromatic index in multigraphs
• Asymptotics of the chromatic index for multigraphs
• Edge-colourings
• Graph edge coloring. Vizing's theorem and Goldberg's conjecture
• Title not available (Why is that?)
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the chromatic index of multigraphs without large triangles
• Graph edge colouring: Tashkinov trees and Goldberg's conjecture

Cited In (5)

• Densities, matchings, and fractional edge-colorings
• A brief history of edge-colorings -- with personal reminiscences
• Graph edge colouring: Tashkinov trees and Goldberg's conjecture
• Structural properties of edge-chromatic critical multigraphs
• Graph edge coloring: a survey

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297916)