Perfect matchings with restricted intersection in cubic graphs
From MaRDI portal
Publication:976153
DOI10.1016/J.EJC.2009.11.007zbMATH Open1218.05137OpenAlexW1989226131MaRDI QIDQ976153FDOQ976153
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
Recommendations
- Non-intersecting perfect matchings in cubic graphs (Extended abstract)
- Perfect matchings in planar cubic graphs
- Unions of perfect matchings in cubic graphs
- scientific article
- Sparsely intersecting perfect matchings in cubic graphs
- The perfect matchings without common edges in cubic graphs
- Connected cubic graphs with the maximum number of perfect matchings
- A new lower bound on the number of perfect matchings in cubic graphs
- An improved linear bound on the number of perfect matchings in cubic graphs
- Perfect matchings in claw-free cubic graphs
Cites Work
- Graphs on surfaces
- Title not available (Why is that?)
- Blocking and anti-blocking pairs of polyhedra
- Fulkerson's conjecture and circuit covers
- On a conjecture of Fan and Raspaud
- Fano colourings of cubic graphs and the Fulkerson conjecture
- Sparsely intersecting perfect matchings in cubic graphs
- Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
- Colouring of cubic graphs by Steiner triple systems
Cited In (17)
- 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
- Fano colourings of cubic graphs and the Fulkerson conjecture
- A superlinear bound on the number of perfect matchings in cubic bridgeless graphs
- Minimum maximal matchings in cubic graphs
- Title not available (Why is that?)
- Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction
- Berge-Fulkerson coloring for some families of superposition snarks
- Perfect matching interdiction problem restricted to a stable vertex
- Non-intersecting perfect matchings in cubic graphs (Extended abstract)
- Cores, joins and the Fano-flow conjectures
- Core index of perfect matching polytope for a 2-connected cubic graph
- Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching
- Treelike snarks
- An equivalent formulation of the Fan-Raspaud Conjecture and related problems
- Title not available (Why is that?)
This page was built for publication: Perfect matchings with restricted intersection in cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976153)
