ON THE 2-EXTENDIBILITY OF PLANAR GRAPHS

被引:25
作者
HOLTON, DA [1 ]
LOU, DJ [1 ]
PLUMMER, MD [1 ]
机构
[1] VANDERBILT UNIV,DEPT MATH,NASHVILLE,TN 37235
基金
美国国家科学基金会;
关键词
D O I
10.1016/0012-365X(91)90227-S
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Some sufficient conditions for the 2-extendability of k-connected k-regular (k greater-than-or-equal-to 3) planar graphs are given. In particular, it is proved that for k greater-than-or-equal-to 3, a k-connected k-regular planar graph with each cyclic cutset of sufficiently large size is 2-extendable.
引用
收藏
页码:81 / 99
页数:19
相关论文
共 10 条
  • [1] BONDY JA, 1976, GRAPH THEORY APPLICA
  • [2] Harary F., 1994, GRAPH THEORY, P11, DOI [DOI 10.21236/AD0705364, 10.1201/9780429493768, DOI 10.1201/9780429493768]
  • [3] HOLTON D, 1988, COLLOQ MATH SOC J B, V52, P281
  • [4] HOLTON DA, 1988, IN PRESS 6TH P INT C
  • [5] HOLTON DA, 1987, 2 EXTENDABILITY 3 PO
  • [6] LOU D, 1988, UNPUB LOWER BOUND CY
  • [7] Lovasz L, 1986, ANN DISCRETE MATH
  • [8] Plummer M.D., 1989, ANN DISCRETE MATH, V41, P347, DOI DOI 10.1016/S0167-5060(08)70473-4
  • [9] ON N-EXTENDABLE GRAPHS
    PLUMMER, MD
    [J]. DISCRETE MATHEMATICS, 1980, 31 (02) : 201 - 210
  • [10] GIRTH IN GRAPHS
    THOMASSEN, C
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1983, 35 (02) : 129 - 141