Classes of 3-regular graphs that are (7, 2)-edge-choosable

Details Classes of 3-regular graphs that are (7, 2)-edge-choosable Classes of 3-regular graphs that are (7, 2)-edge-choosable

2008-06-08

arxiv.org/abs/0806.1348v1

SIAM Journal of Discrete Math. Vol. 23(2), 2009, pp. 872-881

Mathematics

Combinatorics

12 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Classes of 3-regular graphs that are (7, 2)-edge-choosable does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Classes of 3-regular graphs that are (7, 2)-edge-choosable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classes of 3-regular graphs that are (7, 2)-edge-choosable will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-65784