SEYMOUR'S CONJECTURE ON 2-CONNECTED GRAPHS OF LARGE PATHWIDTH

被引:2
|
作者
Huynh, Tony [1 ]
Joret, Gwenael [2 ]
Micek, Piotr [3 ]
Wood, David R. [1 ]
机构
[1] Monash Univ, Sch Math, Melbourne, Vic, Australia
[2] Univ Libre Bruxelles, Dept Informat, Brussels, Belgium
[3] Jagiellonian Univ, Theoret Comp Sci Dept, Fac Math & Comp Sci, Krakow, Poland
基金
澳大利亚研究理事会;
关键词
05C83;
D O I
10.1007/s00493-020-3941-3
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We prove a conjecture of Seymour (1993) stating that for every apex-forest H-1 and outerplanar graph H-2 there is an integer p such that every 2-connected graph of pathwidth at least p contains H-1 or H-2 as a minor. An independent proof was recently obtained by Dang and Thomas [3].
引用
收藏
页码:839 / 868
页数:30
相关论文
共 50 条
  • [1] Seymour’s Conjecture on 2-Connected Graphs of Large Pathwidth
    Tony Huynh
    Gwenaël Joret
    Piotr Micek
    David R. Wood
    Combinatorica, 2020, 40 : 839 - 868
  • [3] Proof of the Seymour conjecture for large graphs
    János Komlós
    Gábor N. Sárközy
    Endre Szemerédi
    Annals of Combinatorics, 1998, 2 (1) : 43 - 60
  • [4] UNAVOIDABLE INDUCED SUBGRAPHS OF LARGE 2-CONNECTED GRAPHS
    Allred, Sarah
    Ding, Guoli
    Oporowski, Bogdan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (02) : 684 - 698
  • [5] 2-connected graphs with small 2-connected dominating sets
    Caro, Y
    Yuster, R
    DISCRETE MATHEMATICS, 2003, 269 (1-3) : 265 - 271
  • [6] MINIMALLY 2-CONNECTED GRAPHS
    DIRAC, GA
    JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 1967, 228 : 204 - &
  • [7] Pruning 2-Connected Graphs
    Chandra Chekuri
    Nitish Korula
    Algorithmica, 2012, 62 : 436 - 463
  • [8] A conjecture on the lower bound of the signed edge domination number of 2-connected graphs
    Feng, Xing
    Ge, Jun
    DISCRETE APPLIED MATHEMATICS, 2021, 302 : 42 - 45
  • [9] Pruning 2-Connected Graphs
    Chekuri, Chandra
    Korula, Nitish
    ALGORITHMICA, 2012, 62 (1-2) : 436 - 463
  • [10] Cycles in 2-connected graphs
    Fan, GH
    Lv, XZ
    Wang, P
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 92 (02) : 379 - 394