4-connected maximal planar graphs are 4-ordered

Authors:
Wayne Goddard
Affiliations:
Department of Computer Science, University of Natal, Durban 4041, South Africa
Venue:
Discrete Mathematics - Kleitman and combinatorics: a celebration
Year:
2002

Citing 3
Cited 1

Graphs & digraphs (2nd ed.)

Graphs & digraphs (2nd ed.)
k-Ordered Hamiltonian graphs

Journal of Graph Theory
Survey of results on k-ordered graphs

Discrete Mathematics

Linkage for the diamond and the path with four vertices

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that in a 4-connected maximal planar graph there is for any four vertices a, b, c and d, a cycle in the graph that contains the four vertices and visits them in the order a, b, c and d.