Lengths of cycles in halin graphs
Authors:
- L. LovászLLL. Lovász
- 1 September 1985
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 9 (3) , 397-410
Abstract
A Halin graph is a plane graph H = T U C, where T is a plane tree with no vertex of degree two and at least one vertex of degree three or more, and C is a cycle connecting the endvertices of T in the cyclic order determined by the embedding of T. We prove that such a graph on n vertices contains cycles of all lengths l, 3 ≤ l n, except, possibly, for one even value m of l. We prove also that if the tree T contains no vertex of degree three then G is pancyclic.Keywords
This publication has 1 reference indexed in Scilit:
- On a Family of Planar Bicritical GraphsProceedings of the London Mathematical Society, 1975