A generalization of Petersen's theorem

DOI10.1016/0012-365X(93)90497-HMaRDI QIDQ1801707zbMATH OpenFDO

Authors Michel X. Goemans

Publication date 20 June 1993

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(93)90497-H

zbMATH Keywords

cubic graphperfect matchingPetersen's theorem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A generalization of Petersen's matching theorem
• 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
• A proof of Petersen's theorem
• Variations on a theorem of Petersen

Cites work

• Conservative weightings and ear-decompositions of graphs
• Covering directed and odd cuts
• Matching, Euler tours and the Chinese postman
• Matchings in regular graphs

Cited in

(4)

• A proof of Petersen's theorem
• On a generalized Petrie's conjecture via index theorems
• Generalizing the Petr-Douglas-Neumann Theorem on N-Gons
• Application of Davies–Petersen Lemma

This page was built for publication: A generalization of Petersen's theorem

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