Tashkinov-trees: an annotated proof

DOI10.1007/S00373-023-02712-1MaRDI QIDQ6184157zbMATH OpenOpenAlexFDO

Authors András Sebö

Publication date 5 January 2024

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-023-02712-1

zbMATH Keywords

bichromatic exchangechromatic indexedge-coloringKempe-chainsTashkinov-tree

Mathematics Subject Classification ID

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

Recommendations

• On a limit of the method of Tashkinov trees for edge-colouring
• Graph edge colouring: Tashkinov trees and Goldberg's conjecture
• A new method of proving theorems on chromatic index
• Structural properties of edge-chromatic critical multigraphs
• Edge-coloring of multigraphs

Cites work

• scientific article; zbMATH DE number 1560509 (Why is no real title available?)
• scientific article; zbMATH DE number 3266380 (Why is no real title available?)
• On the chromatic index of multigraphs without large triangles

This page was built for publication: Tashkinov-trees: an annotated proof

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