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

DOI10.1016/J.DISC.2016.03.025MaRDI QIDQ297916zbMATH OpenOpenAlexFDO

Authors 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

edge colouringmultigraphsdefective colourGoldberg-Seymour conjectureKempe changesTashkinov tree

Mathematics Subject Classification ID

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

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.

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

Cites work

• scientific article; zbMATH DE number 3470445 (Why is no real title available?)
• scientific article; zbMATH DE number 1560509 (Why is no real title available?)
• scientific article; zbMATH DE number 4195987 (Why is no real title available?)
• 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
• Graph edge colouring: Tashkinov trees and Goldberg's conjecture
• Maximum matching and a polyhedron with 0,1-vertices
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• On the chromatic index of multigraphs without large triangles
• The NP-Completeness of Edge-Coloring

Cited in

(6)

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

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)