Minimal 3-edge-connected Collapsible Graphs
Received:November 12, 1990  
Key Words:   
Fund Project:
Author NameAffiliation
Han Zhenyao Dept. Math.
Liaoning Normal University 
Hits: 1646
Download times: 1205
Abstract:
      In this paper confirmes the following conjecture: Let G be a nontuimal connected reduced graph, if F(G) = 2, then G ∈{K2,t;t≥1}
Citation:
DOI:10.3770/j.issn:1000-341X.1992.04.033
View Full Text  View/Add Comment