On k-path hamiltonian maximal planar graphs

k-path hamiltonian maximal planar graphs are characterized using the connectivity number of such graphs.

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 40; no. 1; pp. 119 - 121
Main Author Baybars, İlker
Format Journal Article
LanguageEnglish
Published Elsevier B.V 1982
Online AccessGet full text

Cover

More Information
Summary:k-path hamiltonian maximal planar graphs are characterized using the connectivity number of such graphs.
ISSN:0012-365X
1872-681X
DOI:10.1016/0012-365X(82)90193-5