论文信息 - Classes of 3-regular graphs that are ( 7 , 2 )-edge-choosable

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

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.

Dean Kelley | D. Cranston | Douglas B. West

[1] R. Isaacs. Infinite Families of Nontrivial Trivalent Graphs Which are not Tait Colorable , 1975 .

[2] Cun-Quan Zhang,et al. n-Tuple Coloring of Planar Graphs with Large Odd Girth , 2002, Graphs Comb..

[3] Alberto Cavicchioli,et al. A survey on snarks and new results: Products, reducibility and a computer search , 1998, J. Graph Theory.

[4] Zsolt Tuza,et al. Every 2-choosable graph is (2m, m)-choosable , 1996, J. Graph Theory.

[5] S. Stahl. n-Tuple colorings and associated graphs , 1976 .

[6] Mark N. Ellingham,et al. List edge colourings of some 1-factorable multigraphs , 1996, Comb..

[7] Margit Voigt,et al. On a conjecture of Erd?s, Rubin and Taylor , 1994 .