arXiv Analytics

Sign in

arXiv:1407.0626 [math.CO]AbstractReferencesReviewsResources

A list analog of Vizing's Theorem for simple graphs with triangles but no other odd cycles

Jessica McDonald

Published 2014-07-02, updated 2015-08-07Version 2

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.

Comments: This paper has been withdrawn by the author
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1310.6766 [math.CO] (Published 2013-10-24)
Extremal numbers for odd cycles
arXiv:1405.6272 [math.CO] (Published 2014-05-24)
On the Number of Paths of length 5 in a Graph
arXiv:1808.03696 [math.CO] (Published 2018-08-10)
Saturation Games for Odd Cycles

Links

Toolbox