EEMCS

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 605 Kb

Official URL: http://dx.doi.org/10.3990/1.9789036528924

Abstract

Research on structural characterizations of graphs is a very popular topic in graph theory. The concepts of contractible edges and removable edges of graphs are powerful tools to study the structure of graphs and to prove properties of graphs by induction.
In 1998, Yin gave a convenient method to construct 4-connected graphs by using the existence of removable edges and contractible edges. He showed that a 4-connected graph can be obtained from a 2-cyclic graph by the following four operations: (i) adding edges, (ii) splitting vertices, (iii) adding vertices and removing edges, and (iv) extending vertices. Based on the above operations, we gave the following definition of removable edges in 4-connected graphs. Definition: Let be a 4-connected graph. For an edge of , we perform the following operations on : First, delete the edge from , resulting in the graph ; Second, for each vertex of degree 3 in , delete from and then completely connect the 3 neighbors of by a triangle. If multiple edges occur, we use single edges to replace them. The final resultant graph is denoted by . If is still 4-connected, then the edge is called "removable"; otherwise, is called "unremovable". In the thesis we get the following results: (1) we study how many removable edges may exist in a cycle of a 4-connected graph, and we give examples to show that our results are in some sense the best possible. (2) We obtain results on removable edges in a longest cycle of a 4-connected graph. We also show that for a 4-connected graph of minimum degree at least 5 or girth at least 4, any edge of is removable or contractible. (3) We study the distribution of removable edges on a Hamilton cycle of a 4-connected graph, and show that our results cannot be improved in some sense. (4) We prove that every 4-connected graph of order at least six except 2-cyclic graph with order 6 has at least removable edges. We also give a structural characterization of 4-connected graphs for which the lower bound is sharp. (5) We study how many removable edges there are in a spanning tree of a 4-connected graph and how many removable edges exist outside a cycle of a 4-connected graph. We also give examples to show that our results can not be improved in some sense.

Export this item as:

• BibTeX
• XML

To correct this item please ask your editor

Repository Staff Only: edit this item