COVERING CONTRACTILE EDGES IN 3-CONNECTED GRAPHS .2. CHARACTERIZING THOSE WITH COVERS OF SIZE 3

Authors
HEMMINGER RL YU XX
Citation
Rl. Hemminger et Xx. Yu, COVERING CONTRACTILE EDGES IN 3-CONNECTED GRAPHS .2. CHARACTERIZING THOSE WITH COVERS OF SIZE 3, Journal of graph theory, 17(2), 1993, pp. 247-252
Citations number
7
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
Journal of graph theory → ACNP
ISSN journal
03649024
Volume
17
Issue
2
Year of publication
1993
Pages
247 - 252
Database
ISI
SICI code
0364-9024(1993)17:2<247:CCEI3G>2.0.ZU;2-E
Abstract
It is shown that if G is a 3-connected graph with \V(G)\ greater-than- or-equal-to 10, then, with the exception of one infinite class based o n K3,p, it takes at least four vertices to cover the set of contractib le edges of G.