Author:
Fiol M. A.,Mazzuoccolo G.,Steffen E.
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$-edge-colorable 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 interrelation and prove some new results. Besides getting new insight into the structure of snarks, we show that such measures give partial results with respect to these important conjectures. The paper closes with a list of open problems and conjectures.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Some snarks are worse than others;European Journal of Combinatorics;2024-03
2. Flow resistance to resistance ratios in cubic graphs;Discrete Applied Mathematics;2024-01
3. Reducible 3-critical graphs;RAIRO - Operations Research;2023-09
4. Graph covers and generalized snarks;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
5. Perfect-matching covers of cubic graphs with colouring defect 3;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023