Cycle lengths in polytopal graphs
If G is a hamiltonian 3-polytopal graph with n vertices, G will be called almost pancyclic of order m (m ≥ 3, m < n) if G has cycles of all lengths other than m. Some constructions are given for 3-valent 3-polytopal graphs which are almost pancyclic of order m, and some related results and problems are discussed.
Unable to display preview. Download preview PDF.
- 1.J. A. Bondy, Cycles in graphs. Combinatorial Structures and Their Applications. Gordon and Breach, New York (1970) 15–18.Google Scholar
- 5.L. Lovász and M. D. Plummer, On a family of planar bicritical graphs. Proc. London Math. Soc. (3) 30 (1975) 187–208.Google Scholar
- 6.J. Malkevitch, On the lengths of cycles in planar graphs. Recent Trends in Graph Theory. Springer-Verlag. Berlin, Heidelberg and New York (1970) 191–195.Google Scholar
- 7.G. H. J. Meredith, Cyclic and Colouring Properties of Graphs PhD Thesis. Southampton University (1973).Google Scholar