Perfect matchings with restricted intersection in cubic graphs
From MaRDI portal
Publication:976153
DOI10.1016/j.ejc.2009.11.007zbMath1218.05137MaRDI QIDQ976153
Publication date: 17 June 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2009.11.007
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Three-matching intersection conjecture for perfect matching polytopes of small dimensions, Covering a cubic graph with perfect matchings, Sparsely intersecting perfect matchings in cubic graphs, Treelike snarks, Cores, joins and the Fano-flow conjectures, Berge-Fulkerson coloring for some families of superposition snarks, Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction, Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching, An equivalent formulation of the Fan-Raspaud Conjecture and related problems
Cites Work
- Unnamed Item
- Unnamed Item
- Sparsely intersecting perfect matchings in cubic graphs
- Fano colourings of cubic graphs and the Fulkerson conjecture
- Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
- Fulkerson's conjecture and circuit covers
- Colouring of cubic graphs by Steiner triple systems
- On a Conjecture of Fan and Raspaud
- Blocking and anti-blocking pairs of polyhedra