Title of article
4-connected maximal planar graphs are 4-ordered Original Research Article
Author/Authors
Wayne Goddard، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
6
From page
405
To page
410
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.
Keywords
Planar , Cycles , k-ordered
Journal title
Discrete Mathematics
Serial Year
2002
Journal title
Discrete Mathematics
Record number
949350
Link To Document