No CrossRef data available.
Article contents
On maximum matchings in cubic graphs with a bounded number of bridge-covering paths
Published online by Cambridge University Press: 17 April 2009
Extract
It is proved that if G is a connected cubic graph of order p all of whose bridges lie on r edge-disjoint paths of G, then every maximum matching of G contains at least P/2 − └2r/3┘ edges. Moreover, this result is shown to be best possible.
- Type
- Research Article
- Information
- Bulletin of the Australian Mathematical Society , Volume 36 , Issue 3 , December 1987 , pp. 441 - 447
- Copyright
- Copyright © Australian Mathematical Society 1987