THE 3-CONNECTED GRAPHS WITH A MAXIMUM MATCHING CONTAINING PRECISELY ONE CONTRACTILE EDGE

Authors
ALDRED REL HEMMINGER RL YU XX
Citation
Rel. Aldred et al., THE 3-CONNECTED GRAPHS WITH A MAXIMUM MATCHING CONTAINING PRECISELY ONE CONTRACTILE EDGE, Journal of graph theory, 18(1), 1994, pp. 37-50
Citations number
13
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
Journal of graph theory → ACNP
ISSN journal
03649024
Volume
18
Issue
1
Year of publication
1994
Pages
37 - 50
Database
ISI
SICI code
0364-9024(1994)18:1<37:T3GWAM>2.0.ZU;2-Z
Abstract
It has previously been shown that if M is a maximum matching in a 3-co nnected graph G, other than K-4, then M contains at least one contract ible edge of G. In this paper, we give a constructive characterization of the 3-connected graphs G having a maximum matching containing only one contractible edge of G. (C) 1994 John Wiley & Sons, Inc.