Abstract
A set of operations on 4-connected graphs is introduced in which only line addition and vertex splitting are involved. It is shown that every 4-connected graph can be assembled from either the complete graph K 5 or the double-axle wheel W 24 on four vertices using only these operations, with 4-connectivity preserved.
Supported in part by the National Science Foundation under Grant CCR-9110824
Supported in part by Texas A&M TEES Excellence Grant and by NATO International Scientific Exchange Program Grant CRG No. 911016.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chen, J., Gross, J. L.: Linearly synthesizing 2-connected simplicial graphs. Submitted for publication (1991)
Chen, J., Kanevsky, A.: On assembly of four-connected graphs (I): Minimal fourconnected graphs. Submitted for publication (1992)
Chen, J., Kanevsky, A.: On assembly of four-connected graphs (II): General theorems. Preprint (1992)
Chen, J., Kanevsky, A.: On assembly of four-connected graphs (III): Algorithms and applications. In preparation (1992)
Chen, J., Kanevsky, A., Tamassia, R.: Algorithm for triconnected ear decomposition of a graph. The 22nd Southeastern Intl. Conf. on Combinatorics, Graph Theory, and Computing Baton Rouge, Feb. 11–15, (1991)
Di Battista, G., Tamassia, R.: On-line graph algorithms with spqr-trees. Lecture Notes in Computer Science 442 (1990) 598–611
Dirac, G. A.: 4-chrome graphen und vollständige 4-graphen. Math. Nachr. 22 (1960) 51–60
Galil, Z., Italiano, G. F.: Maintaining biconnected components of dynamic planar graphs. Proc. 18th ICALP (1991)
Galil, Z., Italiano, G. F.: Fully dynamic algorithms for edge-connectivity problem. Proc. 23rd STOC, ACM (1991) 317–327
Kanevsky, A., Tamassia, R., Di Battista, G., Chen, J.: On-line maintenance of the four-connected components of a graph. Proc. 32nd FOCS, IEEE (1991) 793–801
Lovasz, L.: Computing ears and branchings in parallel. Proc. 26th FOCS, IEEE (1985) 464–467
Miller, G. L., Ramachandran, V.: A new graph triconnectivity algorithm and its application. Proc. 19th STOC, ACM (1987) 254–263
Robertson, N., Seymour, P. D.: Graph minors XVI. Wagner's conjecture. J. Combinatorial Theory B To appear
Slater, P. J.: A classification of 4-connected graphs. J. Combinatorial Theory B 17 (1974) 281–298
Tutte, W. T.: A theory of 3-connected graphs. Nederl. Akad. Wetersch. Proc. 64 (1961) 441–445
Tutte, W. T.: Connectivity in Graphs. University of Toronto Press (1966)
Westbrook, J., Tarjan, R. E.: Maintaining bridge-connected and biconnected components on-line. Algorithmica 7 (1992) 433–464
Whitney, H.: Non-separable and planar graphs. Trans. Amer. Math. Soc. 34 (1932) 339–362
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, J., Kanevsky, A. (1993). On assembly of four-connected graphs. In: Mayr, E.W. (eds) Graph-Theoretic Concepts in Computer Science. WG 1992. Lecture Notes in Computer Science, vol 657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56402-0_45
Download citation
DOI: https://doi.org/10.1007/3-540-56402-0_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56402-7
Online ISBN: 978-3-540-47554-5
eBook Packages: Springer Book Archive