Cubic graphs that cannot be covered with four perfect matchings
From MaRDI portal
Publication:2040017
DOI10.1016/J.JCTB.2021.04.004zbMath1467.05207arXiv2008.01398OpenAlexW3162135753MaRDI QIDQ2040017
Edita Máčajová, Martin Škoviera
Publication date: 6 July 2021
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.01398
Related Items (4)
The extremal average distance of cubic graphs ⋮ Ban–Linial's Conjecture and treelike snarks ⋮ Deciding whether four perfect matchings can cover the edges of a snark is NP-complete ⋮ Some snarks are worse than others
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On snarks that are far from being 3-edge colorable
- The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem
- Generation and properties of snarks
- Treelike snarks
- Fano colourings of cubic graphs and the Fulkerson conjecture
- Fulkerson's conjecture and circuit covers
- Colouring of cubic graphs by Steiner triple systems
- Factorisation of snarks
- A note on Fouquet-Vanherpes question and Fulkerson conjecture
- Projective, affine, and abelian colorings of cubic graphs
- On the number of certain types of polyhedra
- On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
- The equivalence of two conjectures of Berge and Fulkerson
- On Perfect Matching Coverings and Even Subgraph Coverings
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- 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
- A unified approach to construct snarks with circular flow number 5
This page was built for publication: Cubic graphs that cannot be covered with four perfect matchings
