A list analog of Vizing's Theorem for simple graphs with triangles but no other odd cycles
Combinatorics
2015-08-11 v2
Abstract
This paper has been withdrawn by the author. Peterson and Woodall previously proved that the list-edge-colouring conjecture holds for graphs without odd cycles of length 5 or longer. D. Peterson and D. R. Woodall, Edge-choosability in line-perfect multigraphs, Discrete Mathematics 202 (1999), 191-199. D. Peterson and D. R. Woodall, Erratum to "Edge-choosability in line-perfect multigraphs", Discrete Mathematics 260 (2003), 323-326.
Keywords
Cite
@article{arxiv.1407.0626,
title = {A list analog of Vizing's Theorem for simple graphs with triangles but no other odd cycles},
author = {Jessica McDonald},
journal= {arXiv preprint arXiv:1407.0626},
year = {2015}
}
Comments
This paper has been withdrawn by the author