Graph edge colouring: Tashkinov trees and Goldberg's conjecture

DOI10.1016/J.JCTB.2009.04.001MaRDI QIDQ968455zbMATH OpenOpenAlexFDO

Authors 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

densityedge colouringTashkinov treechromatic indexGoldberg's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Structural properties of edge-chromatic critical multigraphs
• Chromatic index determined by fractional chromatic index
• scientific article; zbMATH DE number 1560509
• On a limit of the method of Tashkinov trees for edge-colouring
• Edge coloring multigraphs without small dense subsets

Cites work

• scientific article; zbMATH DE number 3470445 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• scientific article; zbMATH DE number 1560509 (Why is no real title available?)
• scientific article; zbMATH DE number 3273761 (Why is no real title available?)
• A Theorem on Coloring the Lines of a Network
• An asymptotic approximation scheme for multigraph edge coloring
• Asymptotics of the chromatic index for multigraphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Edge-coloring of multigraphs: Recoloring technique
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• On edge-colorings of graphs.
• On the $1.1$ Edge-Coloring of Multigraphs

Cited in

(18)

• scientific article; zbMATH DE number 1929924 (Why is no real title available?)
• Chromatic index determined by fractional chromatic index
• A combined logarithmic bound on the chromatic index of multigraphs
• Short fans and the 5/6 bound for line graphs
• Goldberg's conjecture is true for random multigraphs
• On a limit of the method of Tashkinov trees for edge-colouring
• Edge coloring multigraphs without small dense subsets
• Vizing's coloring algorithm and the fan number
• On characterizing Vizing's edge colouring bound
• A brief history of edge-colorings -- with personal reminiscences
• Tashkinov-trees: an annotated proof
• On a theorem of Goldberg
• Efficiently list‐edge coloring multigraphs asymptotically optimally
• Structural properties of edge-chromatic critical multigraphs
• Orientation‐based edge‐colorings and linear arboricity of multigraphs
• On Vizing's bound for the chromatic index of a multigraph
• Proof of the Goldberg-Seymour conjecture on edge-colorings of multigraphs
• Graph edge coloring: a survey

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

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