×

On a limit of the method of Tashkinov trees for edge-colouring. (English) Zbl 1338.05072

Summary: 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.

MSC:

05C15 Coloring of graphs and hypergraphs
05C05 Trees
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] Edmonds, J., Maximum matching and a polyhedron with 0,1-vertices, J. Res. Natl. Bur. Stand. (B), 69, 125-130 (1965) · Zbl 0141.21802
[3] Goldberg, M. K., On multigraphs with almost-maximal chromatic class, Diskret. Anal., 23, 3-7 (1973), (in Russian) · Zbl 0301.05110
[4] Holyer, I., The NP-completeness of edge-colouring, SIAM J. Comput., 10, 4, 718-720 (1981) · Zbl 0473.68034
[5] Kahn, J., Asymptotics of the chromatic index for multigraphs, J. Combin. Theory Ser. (B), 68, 223-254 (1996) · Zbl 0861.05026
[6] Kierstead, H. A., On the chromatic index of multigraphs without large triangles, J. Combin. Theory Ser. (B), 36, 156-160 (1984) · Zbl 0541.05027
[7] Marcotte, O., On the chromatic index of multigraphs and a conjecture of Seymour, (Cook, W.; Seymour, P. D., Proc. DIMACS Workshop, Morristown, NJ (1990), American Mathematical Society), 245-279 · Zbl 0725.05038
[8] McDonald, J., Multigraphs with high chromatic index (2009), University of Waterloo, (Ph.D. thesis) · Zbl 1198.05065
[9] McDonald, J., Edge-colourings, (Beineke, L. W.; Wilson, R. J., Topics in Chromatic Graph Theory (2015), Cambridge University Press) · Zbl 1355.05113
[10] Scheide, D., Graph edge-colouring: Tashkinov trees and Goldberg’s conjecture, J. Combin. Theory Ser. (B), 100, 68-96 (2010) · Zbl 1210.05051
[11] Seymour, P., On multi-colourings of cubic graphs, and conjectures of Fulkerson and Tutte, Proc. Lond. Math. Soc., 3, 423-460 (1979) · Zbl 0411.05037
[12] Stiebitz, M.; Scheide, D.; Toft, B.; Favrholt, L., Graph Edge-Colouring: Vizing’s Theorem and Goldberg’s Conjecture (2012), Wiley · Zbl 1339.05001
[13] Tashkinov, V. A., On an algorithm to color the edges of a multigraph, Diskret. Anal., 7, 72-85 (2000), (in Russian) · Zbl 0955.05036
[14] Vizing, V. G., On an estimate of the chromatic class of a \(p\)-graph, Diskret. Anal., 3, 25-30 (1964)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.