4-connected maximal planar graphs are 4-ordered

DOI10.1016/S0012-365X(02)00438-7zbMath1007.05068OpenAlexW2074134865MaRDI QIDQ1850021

Wayne Goddard

Publication date: 2 December 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00438-7

zbMATH Keywords

\(k\)-orderedmaximal planar

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (6)

Linkage for the diamond and the path with four vertices ⋮ Every 5-connected planar triangulation is 4-ordered Hamiltonian ⋮ 4-connected triangulations and 4-orderedness ⋮ 7-connected graphs are 4-ordered ⋮ (3,3)-linked planar graphs ⋮ Connectivity for Kite-Linked Graphs

This page was built for publication: 4-connected maximal planar graphs are 4-ordered