Sparsely intersecting perfect matchings in cubic graphs
From MaRDI portal
Publication:397063
Recommendations
Cites work
- Blocking and anti-blocking pairs of polyhedra
- Fano colourings of cubic graphs and the Fulkerson conjecture
- Five cycle double covers of some cubic graphs
- Fulkerson's conjecture and circuit covers
- Non-intersecting perfect matchings in cubic graphs (Extended abstract)
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Perfect matchings with restricted intersection in cubic graphs
- Projective, affine, and abelian colorings of cubic graphs
Cited in
(27)- Three-matching intersection conjecture for perfect matching polytopes of small dimensions
- Cubic graphs with colouring defect 3
- The Fan-Raspaud conjecture: a randomized algorithmic approach and application to the pair assignment problem in cubic networks
- Perfect matching covers of cubic graphs of oddness 2
- Perfect matchings with restricted intersection in cubic graphs
- Petersen cores and the oddness of cubic graphs
- Nowhere-zero 5-flows on cubic graphs with oddness 4
- On family of cubic graphs containing flower snarks
- Fulkerson's conjecture and circuit covers
- scientific article; zbMATH DE number 1916568 (Why is no real title available?)
- On two consequences of Berge-Fulkerson conjecture
- Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction
- The perfect matchings without common edges in cubic graphs
- Berge-Fulkerson coloring for some families of superposition snarks
- Measures of edge-uncolorability of cubic graphs
- On a conjecture of Fan and Raspaud
- On Fulkerson conjecture
- Girth, oddness, and colouring defect of snarks
- An equivalent formulation of the Fan-Raspaud conjecture and related problems
- Five-cycle double cover and shortest cycle cover
- Non-intersecting perfect matchings in cubic graphs (Extended abstract)
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
- Cores, joins and the Fano-flow conjectures
- On the existence of graphs which can colour every regular graph
- Perfect matching index versus circular flow number of a cubic graph
- Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching
- Snarks with resistance \(n\) and flow resistance \(2n\)
This page was built for publication: Sparsely intersecting perfect matchings in cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q397063)
