Name
Abstract | ||
|---|---|---|
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⌉. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0012-365X(02)00542-3 | Discrete Mathematics |
Keywords | Field | DocType |
strong pathwidth k,pagenumber,strong pathwidth-k graph,pathwidth,pathwidth k,maximum pagenumber,pathwidth-k graph,strong pathwidth,book embedding | Graph theory,Graph,Discrete mathematics,Combinatorics,Embedding,Book embedding,Pathwidth,Mathematics | Journal |
Volume | Issue | ISSN |
259 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
4 | 0.47 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mitsunori Togasaki | 1 | 130 | 9.51 |
| Koichi Yamazaki | 2 | 222 | 21.85 |