CYCLES THROUGH 10 VERTICES IN 3-CONNECTED CUBIC GRAPHS

被引：9
作者：
ELLINGHAM, MN
HOLTON, DA
LITTLE, CHC
机构：
[1] UNIV WATERLOO,DEPT COMBINATOR & OPTIMIZAT,WATERLOO N2L 3G1,ONTARIO,CANADA
[2] UNIV MELBOURNE,DEPT MATH,PARKVILLE,VIC 3052,AUSTRALIA
[3] MASSEY UNIV,DEPT MATH & STAT,PALMERSTON NORTH,NEW ZEALAND
来源：
COMBINATORICA | 1984年 / 4卷 / 04期
关键词：
D O I：
10.1007/BF02579136
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：265 / 273
页数：9
相关论文
共 6 条
[1]  
BONDY JA, 1976, GRAPH THEORY APPLICA
[2]  
BUSSEMAKER FC, 1976, WSK01 TU EINDH MATH
[3]  
ELLINGHAM MN, 1982, LECT NOTES MATH, V952, P252
[4]   A 9 POINT THEOREM FOR 3-CONNECTED GRAPHS [J].
HOLTON, DA ;
MCKAY, BD ;
PLUMMER, MD ;
THOMASSEN, C .
COMBINATORICA, 1982, 2 (01) :53-62
[5]   WHEN M-VERTICES IN A K-CONNECTED GRAPH CANNOT BE WALKED ROUND ALONG A SIMPLE CYCLE [J].
KELMANS, AK ;
LOMONOSOV, MV .
DISCRETE MATHEMATICS, 1982, 38 (2-3) :317-322
[6]  
KELMANS AK, 1982, AM MATH SOC ABSTR, V3, P283
1