Covering contractible edges in 3-connect
β
Robert L. Hemminger; Xingxing Yu
π
Article
π
1993
π
John Wiley and Sons
π
English
β 272 KB
π 1 views
## Abstract 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.