ScienceOpen: research and publishing network

For Researchers

Search
Advanced search

12

views

    

0

recommends

0

shares

Record: found
Abstract: found
Article: found

Is Open Access

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

Preprint

Author(s): Daniel W. Cranston , Douglas B. West

Publication date Created: 08 June 2008

Read this article at

ScienceOpen ArXiv

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

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.

Related collections

Most cited references 5

Record: found
Abstract: not found
Article: not found

n-Tuple colorings and associated graphs

Saul Stahl (1976)

0 comments Cited 22 times – based on 0 reviews      Review now

Record: found
Abstract: not found
Article: not found

List edge colourings of some 1-factorable multigraphs

M. Ellingham, Luis Goddyn (1996)

0 comments Cited 10 times – based on 0 reviews      Review now

Record: found
Abstract: not found
Article: not found

Every 2-choosable graph is (2m, m)-choosable

Zs. Tuza, M. Voigt (1996)

0 comments Cited 7 times – based on 0 reviews      Review now

Author and article information

Journal

Publication date Created: 08 June 2008

Article

ArXiV ID: 0806.1348

SO-VID: 2c1dee8e-d42f-4d9d-ab89-4e6120b978ef

License:

http://arxiv.org/licenses/nonexclusive-distrib/1.0/

History

Custom metadata

ACM classes 05D99

Report No DIMACS TR: 2008-03

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

Comments 12 pages, 1 figure

Categories math.CO

Data availability:

Comments

Comment on this article