Graph Theory pp 248-256 | Cite as

On Halin graphs

  • Maciej M. Sysło
  • Andrzej Proskurowski
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 1018)


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.


Planar Graph Chromatic Number Hamiltonian Cycle Intersection Graph Interior Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    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.Google Scholar
  2. [2]
    H.J. Fleischner, D.P. Geller and F. Harary, Outerplanar graphs and weak duals, J. Indian Math. Soc., 38 (1974), 215–219.MathSciNetzbMATHGoogle Scholar
  3. [3]
    M.R. Garey and D.S. Johnson, Computers and Intractability, W.H. Freeman, San Francisco, (1979).zbMATHGoogle Scholar
  4. [4]
    R. Halin, Studies in minimally connected graphs, in: Combinatorial Mathematics and its Applications, D.J.A. Weish (ed.), Academic Press, (1971), 129–136.Google Scholar
  5. [5]
    L. Lovász and M.D. Plummer, On a family of planar bioritical graphs, Proc. London Math. Soc., 30 (1975), 187–203.Google Scholar
  6. [6]
    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.Google Scholar
  7. [7]
    A. Proskurowski and M.M. Sysło, Minimum dominating cycles in outerplanar graphs, Int. J. Comp. Info. Sci, 10 (1981), 127–139.MathSciNetCrossRefzbMATHGoogle Scholar
  8. [8]
    M.M. Sysło, Outerplanar graphs: characterizations, testing, coding, and counting, Bull. Acad. Polon. Sci., Ser. Sci. Math., Astr., Phys., 26 (1978), 675–684.MathSciNetzbMATHGoogle Scholar
  9. [9]
    M.M. Sysło, Characterizations of outerplanar graphs, Discrete Math., 26 (1979), 47–53.MathSciNetCrossRefzbMATHGoogle Scholar
  10. [10]
    M.M. Sysło, The subgraph isomorphism problem for outerplanar graphs, Theor. Comp. Sci., 17 (1981), 91–97.MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag 1983

Authors and Affiliations

  • Maciej M. Sysło
    • 1
  • Andrzej Proskurowski
    • 2
  1. 1.Institute of Computer ScienceUniversity of WrocławWrocławPoland
  2. 2.Department of Computer and Information ScienceUniversity of OregonEugeneUSA

Personalised recommendations