Abstract
Let G be a 3-connected graph and e an edge of G. If, by deleting e from G, the resultant graph G - e is a 3-connected graph or a subdivision of a 3-connected graph, then e is called a removable edge of G. In this paper we obtain that there are at least two removable edges in a spanning tree of a 3-connected 3-regular graph. Also we give an O(n3) time algorithm to find all removable edges in G. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Kang, H., Wu, J., & Li, G. (2007). Removable edges of a spanning tree in 3-connected 3-regular graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4613 LNCS, pp. 337–345). Springer Verlag. https://doi.org/10.1007/978-3-540-73814-5_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
