Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching

DOI10.1016/j.jctb.2022.12.003OpenAlexW4313241592MaRDI QIDQ2692777

František Kardoš, Jean Paul Zerafa, Edita Máčajová

Publication date: 23 March 2023

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.10021

zbMATH Keywords

cubic graphsnarkcircuitfactorperfect matchingBerge-Fulkerson conjectureFan-Raspaud conjecture\(S_4\)-conjecture

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

On the existence of graphs which can colour every regular graph ⋮ \(H\)-colorings for 4-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Sparsely intersecting perfect matchings in cubic graphs
• Exponentially many perfect matchings in cubic graphs
• Fano colourings of cubic graphs and the Fulkerson conjecture
• Perfect matchings with restricted intersection in cubic graphs
• Matching theory
• Fulkerson's conjecture and circuit covers
• Colouring of cubic graphs by Steiner triple systems
• A remark on Petersen coloring conjecture of Jaeger
• The equivalence of two conjectures of Berge and Fulkerson
• An equivalent formulation of the Fan-Raspaud Conjecture and related problems
• On Sylvester Colorings of Cubic Graphs
• On two consequences of Berge–Fulkerson conjecture
• S_12 and P_12-colorings of cubic graphs
• Blocking and anti-blocking pairs of polyhedra
• On the existence of graphs which can colour every regular graph