Some snarks are worse than others
From MaRDI portal
Publication:6181999
DOI10.1016/j.ejc.2023.103832arXiv2004.14049MaRDI QIDQ6181999
Jean Paul Zerafa, Vahan V. Mkrtchyan, Giuseppe Mazzuoccolo, Edita Máčajová
Publication date: 23 January 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.14049
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of permutation snarks
- Generation and properties of snarks
- Measures of edge-uncolorability of cubic graphs
- Treelike snarks
- Computational results and new bounds for the circular flow number of snarks
- Matching structure and the matching lattice
- On Tutte's extension of the four-colour problem
- Short cycle covers and the cycle double cover conjecture
- Colouring problems
- Fulkerson's conjecture and circuit covers
- Optimal ear decompositions of matching covered graphs and bases for the matching lattice
- Cubic graphs that cannot be covered with four perfect matchings
- On essentially 4-edge-connected cubic bricks
- Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
- On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
- Short Cycle Covers of Graphs with Minimum Degree Three
- The equivalence of two conjectures of Berge and Fulkerson
- On Perfect Matching Coverings and Even Subgraph Coverings
- Covering Multigraphs by Simple Circuits
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- On (k,d)-colorings and fractional nowhere-zero flows
- 1‐Factor and Cycle Covers of Cubic Graphs
- Perfect Matching Index versus Circular Flow Number of a Cubic Graph
- On the strong circular 5‐flow conjecture
- Blocking and anti-blocking pairs of polyhedra
- A Contribution to the Theory of Chromatic Polynomials
- Edge colorings and circular flows on regular graphs
