On k-path Hamiltonian maximal planar graphs

DOI10.1016/0012-365X(82)90193-5MaRDI QIDQ1163036zbMATH OpenOpenAlexFDO

Authors Ilker Baybars

Publication date 1982

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(82)90193-5

zbMATH Keywords

connectivitymaximal planar graphk-path hamiltonian graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Structural characterization of families of graphs (05C75)

Cites work

• scientific article; zbMATH DE number 3298608 (Why is no real title available?)
• A Theorem on Planar Graphs
• Graph theory
• On k-path Hamiltonian maximal planar graphs
• On the number of cycles of lengthk in a maximal planar graph
• Parallel concepts in graph theory
• Some Theorems on Abstract Graphs

Cited in

(1)

• On k-path Hamiltonian maximal planar graphs

This page was built for publication: On k-path Hamiltonian maximal planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1163036)