Loading...
Loading...

Go to the content (press return)

Measures of edge-uncolorability of cubic graphs

Author
Fiol, M.; G. Mazzuoccolo; E. Steffen
Type of activity
Journal article
Journal
Electronic journal of combinatorics
Date of publication
2018-12-21
Volume
25
Number
4
First page
1
Last page
35
Project funding
2017SGR1087 - Combinatòria, Teoria de Grafs i Aplicacions
Repository
http://hdl.handle.net/2117/126896 Open in new window
URL
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i4p54/pdf Open in new window
Abstract
There are many hard conjectures in graph theory, like Tutte’s 5-flow conjecture, and the 5-cycle double cover conjecture, which would be true in general if they would be true for cubic graphs. Since most of them are trivially true for 3-edgecolorable cubic graphs, cubic graphs which are not 3-edge-colorable, often called snarks, play a key role in this context. Here, we survey parameters measuring how far apart a non 3-edge-colorable graph is from being 3-edge-colorable. We study their interre...
Citation
Fiol, M., G. Mazzuoccolo, E. S. Measures of edge-uncolorability of cubic graphs. "Electronic journal of combinatorics", 21 Desembre 2018, vol. 25, núm. 4, p. 1-35.
Keywords
Cubic graph, edge-coloring, snark
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

Attachments