Classes of 3-regular graphs that are (7, 2)-edge-choosable
Combinatorics
2011-10-12 v1
Abstract
A graph is (7, 2)-edge-choosable if, for every assignment of lists of size 7 to the edges, it is possible to choose two colors for each edge from its list so that no color is chosen for two incident edges. We show that every 3-edge-colorable graph is (7, 2)-edge-choosable and also that many non-3-edge-colorable 3-regular graphs are (7, 2)-edge-choosable.
Keywords
Cite
@article{arxiv.0806.1348,
title = {Classes of 3-regular graphs that are (7, 2)-edge-choosable},
author = {Daniel W. Cranston and Douglas B. West},
journal= {arXiv preprint arXiv:0806.1348},
year = {2011}
}
Comments
12 pages, 1 figure