Cubic graphs with colouring defect 3
From MaRDI portal
Publication:6126449
DOI10.37236/12333arXiv2308.13639MaRDI QIDQ6126449
Edita Máčajová, Ján Karabáš, Roman Nedela, Martin Škoviera
Publication date: 9 April 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2308.13639
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Flows in graphs (05C21)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparsely intersecting perfect matchings in cubic graphs
- Generation and properties of snarks
- Intersecting 1-factors and nowhere-zero 5-flows
- Measures of edge-uncolorability of cubic graphs
- Decomposition of 3-connected cubic graphs
- Fano colourings of cubic graphs and the Fulkerson conjecture
- A remark on noncolorable cubic graphs
- Fulkerson's conjecture and circuit covers
- Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
- Classification and characterizations of snarks
- Cores, joins and the Fano-flow conjectures
- House of Graphs: a database of interesting graphs
- 6-decomposition of snarks
- Snarks without small cycles
- Girth, oddness, and colouring defect of snarks
- Snarks from a Kászonyi perspective: a survey
- Factorisation of snarks
- Petersen Cores and the Oddness of Cubic Graphs
- Decomposition of snarks
- Decompositions and reductions of snarks
- 1‐Factor and Cycle Covers of Cubic Graphs
- Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks
- On the number of colorings of a snark minus an edge
- On the strong circular 5‐flow conjecture
This page was built for publication: Cubic graphs with colouring defect 3
