Counterexamples to a conjecture of Merker on 3-connected cubic planar graphs with a large cycle spectrum gap

被引：1
|
作者：
Zamfirescu, Carol T. [1 ,2 ]
机构：
[1] Univ Ghent, Dept Appl Math Comp Sci & Stat, Krijgslaan 281 S9, B-9000 Ghent, Belgium
[2] Babe Bolyai Univ, Dept Math, Cluj Napoca, Romania
来源：
DISCRETE MATHEMATICS | 2022年 / 345卷 / 06期
关键词：
Cycles; Cycle spectrum; 3-connected; Cubic; Planar graphs;
D O I：
10.1016/j.disc.2022.112824
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Merker conjectured that if k >= 2 is an integer and G a 3-connected cubic planar graph of circumference at least k, then the set of cycle lengths of G must contain at least one element of the interval [k, 2k + 2]. We here prove that for every even integer k >= 6 there is an infinite family of counterexamples. (c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数：2
相关论文
共 50 条
  • [41] 2-CONNECTED SPANNING SUBGRAPHS OF PLANAR 3-CONNECTED GRAPHS
    BARNETTE, DW
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1994, 61 (02) : 210 - 216
  • [42] Infinite family of 3-connected cubic transmission irregular graphs
    Dobrynin, Andrey A.
    DISCRETE APPLIED MATHEMATICS, 2019, 257 : 151 - 157
  • [43] NON-HAMILTONIAN 3-CONNECTED CUBIC BIPARTITE GRAPHS
    ELLINGHAM, MN
    HORTON, JD
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1983, 34 (03) : 350 - 353
  • [44] CYCLES CONTAINING 12 VERTICES IN 3-CONNECTED CUBIC GRAPHS
    BAU, S
    HOLTON, D
    JOURNAL OF GRAPH THEORY, 1991, 15 (04) : 421 - 429
  • [45] AN 11-VERTEX THEOREM FOR 3-CONNECTED CUBIC GRAPHS
    ALDRED, REL
    BAUSHENG
    HOLTON, DA
    ROYLE, GF
    JOURNAL OF GRAPH THEORY, 1988, 12 (04) : 561 - 570
  • [46] CYCLES THROUGH 10 VERTICES IN 3-CONNECTED CUBIC GRAPHS
    ELLINGHAM, MN
    HOLTON, DA
    LITTLE, CHC
    COMBINATORICA, 1984, 4 (04) : 265 - 273
  • [47] CYCLES THROUGH 5 EDGES IN 3-CONNECTED CUBIC GRAPHS
    ALDRED, REL
    HOLTON, DA
    GRAPHS AND COMBINATORICS, 1987, 3 (04) : 299 - 311
  • [48] CYCLES THROUGH 4 EDGES IN 3-CONNECTED CUBIC GRAPHS
    ALDRED, REL
    HOLTON, DA
    THOMASSEN, C
    GRAPHS AND COMBINATORICS, 1985, 1 (01) : 7 - 11
  • [49] Strictly-Convex Drawings of 3-Connected Planar Graphs
    Bekos, Michael A.
    Gronemann, Martin
    Montecchiani, Fabrizio
    Symvonis, Antonios
    GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2022, 2023, 13764 : 144 - 156
  • [50] Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
    Fabrici, I
    Jendrol, S
    GRAPHS AND COMBINATORICS, 1997, 13 (03) : 245 - 250
12345