On the connectivity of maximal planar graphs
Authors:
- 1 December 1978
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 2 (4) , 307-314
Abstract
Let d1 ⩾ d2 ⩾ … ⩾ dp be the vertex degrees of a maximal planar graph G. Etourneau has shown that if d1 ⩽ 6 and dp = 5, then G is 5‐connected. We generalize Etourneau's result by giving sufficient conditions in terms of the vertex degrees for G to be dp ‐connected.Keywords
This publication has 3 references indexed in Scilit:
- On Planar Graphical Degree SequencesSIAM Journal on Applied Mathematics, 1977
- GRAPH THEORY1969
- Congruent Graphs and the Connectivity of GraphsAmerican Journal of Mathematics, 1932