Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable
From MaRDI portal
Publication:3563947
DOI10.1137/080716335zbMATH Open1191.05039arXiv0806.1348OpenAlexW2154171949MaRDI QIDQ3563947
Douglas B. West, Daniel W. Cranston
Publication date: 1 June 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0806.1348
This page was built for publication: Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563947)
