4-connected maximal planar graphs are 4-ordered

被引：5
|
作者：
Goddard, W [1 ]
机构：
[1] Univ Natal, Dept Comp Sci, ZA-4041 Durban, South Africa
来源：
DISCRETE MATHEMATICS | 2002年 / 257卷 / 2-3期
关键词：
planar; cycles; k-ordered;
D O I：
10.1016/S0012-365X(02)00438-7
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：405 / 410
页数：6
相关论文
共 50 条
12345