Tashkinov-Trees: an Annotated Proof

被引：0
|
作者：
András Sebő
机构：
[1] CNRS,
[2] Univ. Grenoble Alpes,undefined
[3] Laboratoire G-SCOP,undefined
来源：
Graphs and Combinatorics | 2024年 / 40卷
关键词：
Edge-coloring; Chromatic index; Bichromatic exchange; Kempe-chains; Tashkinov-tree; 05C15;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Tashkinov-trees have been used as a tool for proving bounds on the chromatic index, and are becoming a fundamental tool for edge-coloring. Was its publication in a language different from English an obstacle for the accessibility of a clean and complete proof of Tashkinov’s fundamental theorem?
引用
收藏
相关论文
共 50 条
12345