中文

含三角形但无其他奇圈的简单图的 Vizing 定理的列表类比

组合数学 2015-08-11 v2

摘要

本文已被作者撤回。Peterson 和 Woodall 此前证明了列表边着色猜想对于不含长度为 5 或更长的奇圈的图成立。D. Peterson 和 D. R. Woodall, "Edge-choosability in line-perfect multigraphs", Discrete Mathematics 202 (1999), 191-199. D. Peterson 和 D. R. Woodall, "Erratum to 'Edge-choosability in line-perfect multigraphs'", Discrete Mathematics 260 (2003), 323-326.

关键词

引用

@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}
}

备注

This paper has been withdrawn by the author