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

DOI10.1017/S0004972700003737zbMath0653.05055OpenAlexW2123209437MaRDI QIDQ3798698

Sergio Ruiz, Gary Chartrand, Ortrud R. Oellermann, 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

maximum matchingperfect matchingbridges

Mathematics Subject Classification ID

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

Cites Work

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

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