On the number of cycles of length k in a maximal planar graph
Authors:
- 1 March 1979
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 3 (1) , 69-86
Abstract
Let G be a maximal planar graph with p vertices, and let Ck(G) denote the number of cycles of length k in G. We first present tight bounds for C3(G) and C4(G) in terms of p. We then give bounds for Ck(G) when 5 ≤ k ≤ p, and consider in particular bounds for Cp(G), in terms of p. Some conjectures and unsolved problems are stated.Keywords
This publication has 5 references indexed in Scilit:
- On the connectivity of maximal planar graphsJournal of Graph Theory, 1978
- On Planar Graphical Degree SequencesSIAM Journal on Applied Mathematics, 1977
- GRAPH THEORY1969
- An introduction to chromatic polynomialsJournal of Combinatorial Theory, 1968
- Graphs with two kinds of elementsJournal of the Franklin Institute, 1960