Unions of perfect matchings in cubic graphs

DOI10.1016/J.ENDM.2005.06.079MaRDI QIDQ3439362zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Tomáš Kaiser, Daniel Král', Serguei Norine

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2005.06.079

zbMATH Keywords

Berge-Fulkerson's conjecturecubic graphsperfect matchings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• scientific article; zbMATH DE number 5130820
• Covering a cubic graph with perfect matchings
• A new lower bound on the number of perfect matchings in cubic graphs
• On disjoint matchings in cubic graphs
• An improved linear bound on the number of perfect matchings in cubic graphs

Cites work

• Blocking and anti-blocking pairs of polyhedra
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• Maximum matching and a polyhedron with 0,1-vertices
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Polyhedral proof methods in combinatorial optimization

Cited in

(15)

• Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes
• Unions of 1-factors in r-graphs and overfull graphs
• On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
• The traveling salesman problem on cubic and subcubic graphs
• Projective, affine, and abelian colorings of cubic graphs
• TSP on cubic and subcubic graphs
• scientific article; zbMATH DE number 5130820 (Why is no real title available?)
• On intersection graphs of 2-matchings in cubic graphs
• A new lower bound on the number of perfect matchings in cubic graphs
• On maximum matchings in cubic graphs with a bounded number of bridge-covering paths
• Covering a cubic graph with perfect matchings
• Corrigendum to: ``Unions of 1-factors in \(r\)-graphs and overfull graphs
• Non-conflicting no-where zero Z₂ Z₂-flows in cubic graphs
• On disjoint matchings in cubic graphs
• Perfect matchings with restricted intersection in cubic graphs

This page was built for publication: Unions of perfect matchings in cubic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439362)