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 条
  • [21] Efficient and constructive algorithms for the pathwidth and treewidth of graphs
    Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, Netherlands
    J Algorithms, 2 (358-402):
  • [22] Cycle decompositions of pathwidth-6 graphs
    Fuchs, Elke
    Gellert, Laura
    Heinrich, Irene
    JOURNAL OF GRAPH THEORY, 2020, 94 (02) : 224 - 251
  • [23] The Bounded Pathwidth of Control-Flow Graphs
    Conrado, Giovanna Kobus
    Goharshady, Amir Kafshdar
    Lam, Chun Kit
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2023, 7 (OOPSLA):
  • [24] Efficient and constructive algorithms for the pathwidth and treewidth of graphs
    Bodlaender, HL
    Kloks, T
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1996, 21 (02): : 358 - 402
  • [25] 2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth
    Angelini, Patrizio
    Da Lozzo, Giordano
    Foerster, Henry
    Schneck, Thomas
    COMPUTER JOURNAL, 2023, 67 (03): : 1005 - 1016
  • [26] A 3-approximation for the pathwidth of Halin graphs
    Fomin, Fedor V.
    Thilikos, Dimitrios M.
    JOURNAL OF DISCRETE ALGORITHMS, 2006, 4 (04) : 499 - 510
  • [27] On virtual pathwidth of virtual graphs of a virtual link
    Khan, Noureen A.
    JOURNAL OF PURE AND APPLIED ALGEBRA, 2019, 223 (02) : 504 - 514
  • [28] The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
    Hatanaka, Tatsuhiko
    Ito, Takehiro
    Zhou, Xiao
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2015, E98A (06): : 1168 - 1178
  • [29] Triangulating Planar Graphs While Keeping the Pathwidth Small
    Biedl, Therese
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2016, 9224 : 425 - 439
  • [30] Some Reduction Procedure for Computing Pathwidth of Undirected Graphs
    Ikeda, Masataka
    Nagamochi, Hiroshi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2015, E98D (03): : 503 - 511
12345