The Number of Removable Edges in a Spanning Tree of a 3-Connected Graph
Let e be an edge of a 3-connected graph G.If G-e is a subdivision of a 3-connected graph,then e is called a removable edge of G.In this paper,we study the number of removable edges in a spanning tree of a 3-connected graph and simply verify that "Let G be a 3-connected graph with |V(G)|≥6 and δ(G)≥4(or g(G)≥4),then the number of removable edges in a spanning tree of G is no less than 2." and prove that any tree of a 3-connected 3-regular graph has at least two removable edges.
ARTICLE TITLE AND BIBLIOGRAPHIC INFORMATION ::: Three-year outcomes of apicectomy (apicoectomy): Mining an insurance database. Raedel M, Hartmann A, Bohm S, Walter MH. J Dent 2015;43:1218-22. ::: ::: ::: SOURCE OF FUNDING ::: Information not available. ::: ::: ::: TYPE OF STUDY/DESIGN ::: Retrospective analysis of administrative claims data.