Premium
Covering contractible edges in 3‐connected graphs. II. Characterizing those with covers of size three
Author(s) -
Hemminger Robert L.,
Yu Xingxing
Publication year - 1993
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190170212
Subject(s) - contractible space , combinatorics , mathematics , graph , class (philosophy) , cover (algebra) , discrete mathematics , set (abstract data type) , computer science , mechanical engineering , artificial intelligence , engineering , programming language
It is shown that if G is a 3‐connected graph with | V(G) | ≥ 10, then, with the exception of one infinite class based on K 3, p , it takes at least four vertices to cover the set of contractible edges of G . © 1993 John Wiley & Sons, Inc.