Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs

被引：0
|
作者：
R. E. L. Aldred
S. Bau
D. A. Holton
Brendan D. McKay
机构：
[1]  Department of Mathematics and Statistics,
[2] University of Otago,undefined
[3] P.O. Box 56,undefined
[4] Dunedin,undefined
[5] New Zealand. e-mail: raldred@maths.otago.ac.nz; dholton@maths.otago.ac.nz,undefined
[6]  Department of Computer Science,undefined
[7] Australian National University,undefined
[8] Canberra,undefined
[9] ACT 0200,undefined
[10] Australia. e-mail: bdm@cs.anu.edu.au,undefined
来源：
Graphs and Combinatorics | 1999年 / 15卷
关键词：
Planar Graph;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
 We establish that if A is a set of at most 23 vertices in a 3-connected cubic planar graph G, then there is a cycle in G containing A. This result is sharp.
引用
收藏
页码：373 / 376
页数：3
相关论文
共 50 条
12345