Pathwidth of planar and line graphs

被引：1

作者：

Fomin, FV ^{[1
]}

机构：

[1] Univ Paderborn, Heinz Nixdorf Inst, D-33102 Paderborn, Germany

来源：

GRAPHS AND COMBINATORICS | 2003年 / 19卷 / 01期

关键词：

pathwidth; treewidth; planar graphs; line graphs;

D O I：

10.1007/s00373-002-0490-z

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We prove that for every 2-connected planar graph the pathwidth of its geometric dual is less than the pathwidth of its line graph. This implies that pathwidth(H) less than or equal to pathwidth(H*) + 1 for every planar triangulation H and leads us to a conjecture that pathwidth(G) less than or equal to pathwidth(G*) + 1 for every 2-connected graph G.

引用

页码：91 / 99

页数：9

共 50 条

[1] Pathwidth of Planar and Line Graphs
Fedor V. Fomin
Graphs and Combinatorics, 2003, 19 : 91 - 99
[2] Triangulating Planar Graphs While Keeping the Pathwidth Small
Biedl, Therese
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2016, 9224 : 425 - 439
[3] ON THE PATHWIDTH OF CHORDAL GRAPHS
GUSTEDT, J
DISCRETE APPLIED MATHEMATICS, 1993, 45 (03) : 233 - 248
[4] Pathwidth of outerplanar graphs
Coudert, David
Huc, Florian
Sereni, Jean-Sebastien
JOURNAL OF GRAPH THEORY, 2007, 55 (01) : 27 - 41
[5] Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs
Togasaki, M
Yamazaki, K
DISCRETE MATHEMATICS, 2002, 259 (1-3) : 361 - 368
[6] Approximating the pathwidth of outerplanar graphs
Govindan, R
Langston, MA
Yan, XD
INFORMATION PROCESSING LETTERS, 1998, 68 (01) : 17 - 23
[7] TREEWIDTH AND PATHWIDTH OF PERMUTATION GRAPHS
BODLAENDER, HL
KLOKS, T
KRATSCH, D
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1995, 8 (04) : 606 - 616
[8] Approximation of pathwidth of outerplanar graphs
Bodlaender, HL
Fomin, FV
JOURNAL OF ALGORITHMS, 2002, 43 (02) : 190 - 200
[9] On the treewidth and pathwidth of biconvex bipartite graphs
Peng, Sheng-Lung
Yang, Yi-Chuan
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007, 4484 : 244 - +
[10] Light Spanners in Bounded Pathwidth Graphs
Grigni, Michelangelo
Hung, Hao-Hsiang
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 467 - 477

← 1 2 3 4 5 →