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 条
  • [11] Light Spanners in Bounded Pathwidth Graphs
    Grigni, Michelangelo
    Hung, Hao-Hsiang
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 467 - 477
  • [12] Pathwidth of circular-arc graphs
    Suchan, Karol
    Todinca, Ioan
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2007, 4769 : 258 - +
  • [13] Pathwidth and Searching in Parameterized Threshold Graphs
    Krishna, D. Sai
    Reddy, T. V. Thirumala
    Shashank, B. Sai
    Rangan, C. Pandu
    WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2010, 5942 : 293 - +
  • [14] Crossing Number for Graphs with Bounded Pathwidth
    Biedl, Therese
    Chimani, Markus
    Derka, Martin
    Mutzel, Petra
    ALGORITHMICA, 2020, 82 (02) : 355 - 384
  • [15] Pathwidth of cubic graphs and exact algorithms
    Fomin, FV
    Hoie, K
    INFORMATION PROCESSING LETTERS, 2006, 97 (05) : 191 - 196
  • [16] Approximating Pathwidth for Graphs of Small Treewidth
    Groenland, Carla
    Joret, Gwenael
    Nadara, Wojciech
    Walczak, Bartosz
    ACM TRANSACTIONS ON ALGORITHMS, 2023, 19 (02)
  • [17] Circumference and Pathwidth of Highly Connected Graphs
    Marshall, Emily A.
    Wood, David R.
    JOURNAL OF GRAPH THEORY, 2015, 79 (03) : 222 - 232
  • [18] BETTER ALGORITHMS FOR THE PATHWIDTH AND TREEWIDTH OF GRAPHS
    BODLAENDER, HL
    KLOKS, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 510 : 544 - 555
  • [19] Crossing Number for Graphs with Bounded Pathwidth
    Therese Biedl
    Markus Chimani
    Martin Derka
    Petra Mutzel
    Algorithmica, 2020, 82 : 355 - 384
  • [20] On compact encoding of pagenumber k graphs
    Gavoille, Cyril
    Hanusse, Nicolas
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2008, 10 (03): : 23 - 34
12345