Sparsely intersecting perfect matchings in cubic graphs
From MaRDI portal
Publication:397063
DOI10.1007/s00493-014-2550-4zbMath1349.05119OpenAlexW1982311159MaRDI QIDQ397063
Edita Máčajová, Martin Škoviera
Publication date: 14 August 2014
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-014-2550-4
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (17)
Snarks with resistance \(n\) and flow resistance \(2n\) ⋮ Girth, oddness, and colouring defect of snarks ⋮ Cores, joins and the Fano-flow conjectures ⋮ Petersen Cores and the Oddness of Cubic Graphs ⋮ Cubic graphs with colouring defect 3 ⋮ On the existence of graphs which can colour every regular graph ⋮ Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching ⋮ Perfect matching covers of cubic graphs of oddness 2 ⋮ An equivalent formulation of the Fan-Raspaud Conjecture and related problems ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction ⋮ Perfect matchings with restricted intersection in cubic graphs ⋮ Berge-Fulkerson coloring for some families of superposition snarks ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ Perfect Matching Index versus Circular Flow Number of a Cubic Graph ⋮ On a Conjecture of Fan and Raspaud ⋮ Nowhere‐Zero 5‐Flows On Cubic Graphs with Oddness 4
Cites Work
- Fano colourings of cubic graphs and the Fulkerson conjecture
- Perfect matchings with restricted intersection in cubic graphs
- Fulkerson's conjecture and circuit covers
- Five cycle double covers of some cubic graphs
- Projective, affine, and abelian colorings of cubic graphs
- Non-intersecting perfect matchings in cubic graphs (Extended abstract)
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Blocking and anti-blocking pairs of polyhedra
This page was built for publication: Sparsely intersecting perfect matchings in cubic graphs
