Let F_(n,k) be the classes of maximal planar graphs G_n (without loops or multiple edges) having k vertices of degree 5 and n-k vertices of degree more than 5. Hakimi and Schmeichel proved that, if G_n belongs to F_(n,k) and k=12,13, then G_n is 5-connected. In this paper the author gives some general conditions in terms of the integers n and k for a graph G_n to be p-connected, with p=4,5
Fanelli, S. (1983). On the connectivity of maximal planar graphs with minimum degree 5, 18, 343-354.
On the connectivity of maximal planar graphs with minimum degree 5
FANELLI, STEFANO
1983-01-01
Abstract
Let F_(n,k) be the classes of maximal planar graphs G_n (without loops or multiple edges) having k vertices of degree 5 and n-k vertices of degree more than 5. Hakimi and Schmeichel proved that, if G_n belongs to F_(n,k) and k=12,13, then G_n is 5-connected. In this paper the author gives some general conditions in terms of the integers n and k for a graph G_n to be p-connected, with p=4,5File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
