Fulkerson-covers of hypohamiltonian graphs
From MaRDI portal
Publication:2345598
DOI10.1016/j.dam.2015.01.009zbMath1311.05160OpenAlexW1963487078MaRDI QIDQ2345598
Publication date: 22 May 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.01.009
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (5)
Covering a cubic graph by 5 perfect matchings ⋮ Berge–Fulkerson coloring for C(12)‐linked permutation graphs ⋮ Berge-Fulkerson coloring for infinite families of snarks ⋮ Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction ⋮ Berge-Fulkerson coloring for some families of superposition snarks
Cites Work
- Unnamed Item
- Research problems from the 5th Slovenian Conference (Bled, 2003)
- A note on Berge-Fulkerson coloring
- Flows and generalized coloring theorems in graphs
- On Tutte's extension of the four-colour problem
- Nowhere-zero 6-flows
- Integer flows and cycle covers
- New families of hypohamiltonian graphs
- New flip-flop constructions for hypohamiltonian graphs
- Extensions of flow theorems
- Hypohamiltonian and hypotraceable graphs
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Flip-Flops in Hypohamiltonian Graphs
- Blocking and anti-blocking pairs of polyhedra
This page was built for publication: Fulkerson-covers of hypohamiltonian graphs