Abstract
The paper deals with a subfamily of those planar graphs which have outerplanar intersection of their MacLane cycle basis. These graphs have been known as Halin graphs. Their connectivity properties, structure of cycles, and feasible embeddings in the plane are discussed here. This paper also presents some initial investigations of NP-complete problems restricted to the family of Halin graphs.
This paper presents results of research done when the first author was visiting Department of Computer and Information Science at the University of Oregon in June 1980.
This is a preview of subscription content, log in via an institution to check access.
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
J.A. Bondy, Pancyclic graphs: recent results, in: A. Hajnal. R. Rado and V.T. Sós (eds.), Infinite and Finite Sets, Colloquia Mathematica Societatis János Bolyai, vol. 10, Kiado (Budapest) and North-Holland (Amsterdam), (1975), 181–187.
H.J. Fleischner, D.P. Geller and F. Harary, Outerplanar graphs and weak duals, J. Indian Math. Soc., 38 (1974), 215–219.
M.R. Garey and D.S. Johnson, Computers and Intractability, W.H. Freeman, San Francisco, (1979).
R. Halin, Studies in minimally connected graphs, in: Combinatorial Mathematics and its Applications, D.J.A. Weish (ed.), Academic Press, (1971), 129–136.
L. Lovász and M.D. Plummer, On a family of planar bioritical graphs, Proc. London Math. Soc., 30 (1975), 187–203.
J. Malkevitch, Cycle lengths in polytopal graphs, in: Y. Alavi and D.R. Lick (eds.), Theory and Applications of Graphs, Springer-Verlag, (1978), 364–370.
A. Proskurowski and M.M. Sysło, Minimum dominating cycles in outerplanar graphs, Int. J. Comp. Info. Sci, 10 (1981), 127–139.
M.M. Sysło, Outerplanar graphs: characterizations, testing, coding, and counting, Bull. Acad. Polon. Sci., Ser. Sci. Math., Astr., Phys., 26 (1978), 675–684.
M.M. Sysło, Characterizations of outerplanar graphs, Discrete Math., 26 (1979), 47–53.
M.M. Sysło, The subgraph isomorphism problem for outerplanar graphs, Theor. Comp. Sci., 17 (1981), 91–97.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag
About this paper
Cite this paper
Sysło, M.M., Proskurowski, A. (1983). On Halin graphs. In: Borowiecki, M., Kennedy, J.W., Sysło, M.M. (eds) Graph Theory. Lecture Notes in Mathematics, vol 1018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0071635
Download citation
DOI: https://doi.org/10.1007/BFb0071635
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12687-4
Online ISBN: 978-3-540-38679-7
eBook Packages: Springer Book Archive