A NEW PLANARITY CRITERION FOR 3-CONNECTED GRAPHS

被引:9
|
作者
KELMANS, AK
机构
关键词
D O I
10.1002/jgt.3190050307
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:259 / 267
页数:9
相关论文
共 50 条
  • [31] Long cycles in 3-connected graphs
    Chen, GT
    Yu, XX
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2002, 86 (01) : 80 - 99
  • [32] Properties of uniformly 3-connected graphs
    Göring F.
    Hofmann T.
    Discrete Mathematics and Theoretical Computer Science, 2023, 25
  • [33] On 3-connected hamiltonian line graphs
    Chen, Ye
    Fan, Suohai
    Lai, Hong-Jian
    DISCRETE MATHEMATICS, 2012, 312 (11) : 1877 - 1882
  • [34] Circumference of 3-connected cubic graphs
    Liu, Qinghai
    Yu, Xingxing
    Zhang, Zhao
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2018, 128 : 134 - 159
  • [35] Contractible circuits in 3-connected graphs
    Barnette, DW
    DISCRETE MATHEMATICS, 1998, 187 (1-3) : 19 - 29
  • [36] Vertex suppression in 3-connected graphs
    Kriesell, Matthias
    JOURNAL OF GRAPH THEORY, 2008, 57 (01) : 41 - 54
  • [37] 3-Connected graphs and their degree sequences
    McLaughlin, Jonathan (jonny_mclaughlin@hotmail.com), 2018, Charles Babbage Research Centre (105):
  • [38] CONTRACTILE EDGES IN 3-CONNECTED GRAPHS
    ANDO, K
    ENOMOTO, H
    SAITO, A
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1987, 42 (01) : 87 - 93
  • [39] Connected spanning subgraphs of 3-connected planar graphs
    Enomoto, H
    Iida, T
    Ota, K
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1996, 68 (02) : 314 - 323
  • [40] THE NUMBER OF CONTRACTIBLE EDGES IN 3-CONNECTED GRAPHS
    OTA, K
    GRAPHS AND COMBINATORICS, 1988, 4 (04) : 333 - 354