Abstract
Consider the class Γ of all 3-regular polyhedral graphs, that is, the class of the planar 3-connected graphs in which each vertex has degree 3. Let C be a circuit of a graph G∈Γ. If one removes from G the vertices of C and all edges incident with them, the resulting graph G-C disintegrates into connected components K1,K2,...,KK. If C is a hamiltonian circuit of G (that is a circuit containing all vertices), then G-C is obviously empty, but in all other cases, however, k > 0 holds. Let Ci be the set of those vertices of C having at least one neighbour in Ki. Since each vertex has the degree 3 in G, a vertex from Ci is incident with exactly one edge which does not belong to C, that is, this vertex is adjacent to one vertex from Ki. In addition, there exists for any vertex x∈ C at most one index i such that x is adjacent to one vertex of Ki. If one adds to Ki the vertices of Ci and also all edges whose one end-vertex belongs to Ci and the other one to Ki, then the resulting graph Bi is called a bridge of G over C. Calling also an edge whose two end-vertices belong to C, but not the edge itself, a bridge, then we see that to each vertex of C there exists exactly one bridge in which this vertex lies. A vertex belonging to both C and Bi is called a touch point of the bridge Bi. Let a bridge over a path be defined accordingly. Let Γ (w) be the class of graphs G in in which there exists for any longest circuit C of G a bridge B over C with at least w touch points.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Grünbaum and H. Walther, Shortness exponents of families of graphs, J. Combin. Theory 14 (1973), 364–385.
J. Harant, Über den shortness exponent regulärer Polyedergraphen, Dissertation A, TH Ilmenau, 1982.
J. Harant and H. Walther, On a Problem Concerning Longest Circuits in Polyhedral Graphs, Annals of Discrete Math. 41 (1989), 211–220, Els. Sci. Publ. B.V. ( North-Holland ).
]W.T. Tutte, On Hamiltonian circuits, J. London Math. Soc. 21 (1946), 98–101.
H. Walther and H.-J. Voß, Über Kreise in Graphen, VEB Deutscher Verlag der Wissenschaften (1974), 58–62.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Physica-Verlag Heidelberg
About this chapter
Cite this chapter
Harant, J., Walther, HJ. (1990). On the Circumference of Regular Polyhedral Graphs. In: Bodendiek, R., Henn, R. (eds) Topics in Combinatorics and Graph Theory. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-46908-4_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-46908-4_36
Publisher Name: Physica-Verlag HD
Print ISBN: 978-3-642-46910-7
Online ISBN: 978-3-642-46908-4
eBook Packages: Springer Book Archive