On maximum matchings in cubic graphs with a bounded number of bridge-covering paths

DOI10.1017/S0004972700003737MaRDI QIDQ3798698zbMATH OpenOpenAlexFDO

Authors Gary Chartrand, Ortrud R. Oellermann, Sergio Ruiz, S. F. Kapoor

Publication date 1987

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0004972700003737

zbMATH Keywords

perfect matchingbridgesmaximum matching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Unions of perfect matchings in cubic graphs
• scientific article; zbMATH DE number 5130820
• On disjoint matchings in cubic graphs
• Covering a cubic graph with perfect matchings
• A generalization of Petersen's matching theorem

Cites work

• TWO THEOREMS IN GRAPH THEORY
• The Factorization of Linear Graphs

Cited in

(6)

• On disjoint matchings in cubic graphs
• A superlinear bound on the number of perfect matchings in cubic bridgeless graphs
• A generalization of Petersen's matching theorem
• Minimum maximal matchings in cubic graphs
• A generalization of Petersen's theorem
• A proof of Petersen's theorem

This page was built for publication: On maximum matchings in cubic graphs with a bounded number of bridge-covering paths

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