Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs

被引：6
|
作者：
Togasaki, M [1 ]
Yamazaki, K [1 ]
机构：
[1] Gunma Univ, Dept Comp Sci, Kiryu, Gumma 3768515, Japan
来源：
DISCRETE MATHEMATICS | 2002年 / 259卷 / 1-3期
关键词：
pagenumber; book embedding; pathwidth; strong pathwidth;
D O I：
10.1016/S0012-365X(02)00542-3
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, it is shown that the maximum pagenumber of the graphs with pathwidth k is k and that the maximum pagenumber of the graphs with strong pathwidth k is in between [3(k - 1)/2] and 3 [k/2]. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：361 / 368
页数：8
相关论文
共 50 条
  • [41] 2-Connecting outerplanar graphs without blowing up the pathwidth
    Babu, Jasine
    Basavaraju, Manu
    Chandran, L. Sunil
    Rajendraprasad, Deepak
    THEORETICAL COMPUTER SCIENCE, 2014, 554 : 119 - 134
  • [42] 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
  • [43] SEYMOUR'S CONJECTURE ON 2-CONNECTED GRAPHS OF LARGE PATHWIDTH
    Huynh, Tony
    Joret, Gwenael
    Micek, Piotr
    Wood, David R.
    COMBINATORICA, 2020, 40 (06) : 839 - 868
  • [44] Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree
    Eickmeyer, Kord
    Kawarabayashi, Ken-ichi
    ALGORITHMIC GAME THEORY, SAGT 2013, 2013, 8146 : 134 - 145
  • [45] Strong k-colourings of graphs
    Zverovich, I.E.
    Discrete Mathematics and Applications, 2001, 11 (01): : 83 - 94
  • [46] A Win/Win Algorithm for the (k+1)-LST/k-Pathwidth Problem
    Klyuchikov A.G.
    Vyalyi M.N.
    Journal of Applied and Industrial Mathematics, 2021, 15 (04): : 627 - 630
  • [47] Strong matching preclusion of (n, k)-star graphs
    Cheng, Eddie
    Kelm, Justin
    Renzi, Joseph
    THEORETICAL COMPUTER SCIENCE, 2016, 615 : 91 - 101
  • [48] Total k-domination in strong product graphs
    Bermudo, S.
    Hernandez-Gomez, J. C.
    Sigarreta, J. M.
    DISCRETE APPLIED MATHEMATICS, 2019, 263 : 51 - 58
  • [49] Strong chromatic index of k-degenerate graphs
    Wang, Tao
    DISCRETE MATHEMATICS, 2014, 330 : 17 - 19
  • [50] Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs
    Lucet, C
    Manouvrier, JF
    Carlier, J
    ALGORITHMICA, 2000, 27 (3-4) : 316 - 336
12345