LONGEST CYCLES IN 3-CONNECTED PLANAR GRAPHS

被引:19
作者
JACKSON, B
WORMALD, NC
机构
[1] UNIV MELBOURNE,DEPT MATH,PARKVILLE,VIC 3052,AUSTRALIA
[2] UNIV AUCKLAND,DEPT MATH & STAT,AUCKLAND,NEW ZEALAND
关键词
D O I
10.1016/0095-8956(92)90058-6
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We give lower bounds on the length of a longest cycle in a planar graph on n vertices which is 3-connected or cyclically 4-connected. © 1992.
引用
收藏
页码:291 / 321
页数:31
相关论文
共 16 条
[1]   TREES IN POLYHEDRAL GRAPHS [J].
BARNETTE, D .
CANADIAN JOURNAL OF MATHEMATICS, 1966, 18 (04) :731-&
[2]  
BONDY JA, 1976, GRAPH THEORY APPLICA
[3]  
CLARK L, 1985, C NUMER, V47, P199
[4]  
Grunbaum B., 1973, Journal of Combinatorial Theory, Series A, V14, P364, DOI 10.1016/0097-3165(73)90012-5
[5]  
Grunbaum B., 1976, AEQUATIONES MATH, V14, P191, DOI DOI 10.1007/BF01836218
[6]   LONGEST CYCLES IN 3-CONNECTED CUBIC GRAPHS [J].
JACKSON, B .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1986, 41 (01) :17-26
[7]   HAMILTON CIRCUITS OF CONVEX TRIVALENT POLYHEDRA (UP TO 18 VERTICES) [J].
LEDERBERG, J .
AMERICAN MATHEMATICAL MONTHLY, 1967, 74 (05) :522-+
[8]   SIMPLE PATHS ON POLYHEDRA [J].
MOON, JW ;
MOSER, L .
PACIFIC JOURNAL OF MATHEMATICS, 1963, 13 (02) :629-&
[9]  
Ore O., 1967, 4 COLOR PROBLEM
[10]   APPLICATIONS OF MENGERS GRAPH THEOREM [J].
PERFECT, H .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1968, 22 (01) :96-+