|
系统科学与数学 1999
REMOVABLE EDGES IN 4-CONNECTED GRAPHS AND A STRUCTURE OF 4-CONNECTED GRAPHS
|
Abstract:
in this paper, we define removable edges in a 4-connected graph and provethat the graph without removable edge is C5 or C6. We also give a structure of 4--connectedgraphs of order n.