Pathwidth of Planar and Line Graphs

2003/03/01 by Fedor V. Fomin · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Interconnection Networks and Systems #Line graph #Mathematics #Outerplanar graph #Pathwidth #Planar graph

paper · doi:10.1007/s00373-002-0490-z

crossref issued 2003/03/01 · crossref published 2003/03/01 · crossref published-print 2003/03/01 · openalex publication_date 2003/03/01 · crossref created 2004/03/19 · crossref deposited 2019/05/28 · crossref indexed 2023/10/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Citations

• Graph minors. III. Planar tree-width
• Searching and pebbling
• The cutwidth of a graph and the vertex separation number of the line graph
• The vertex separation number of a graph equals its path-width
• The Vertex Separation and Search Number of a Graph
• A partial k-arboretum of graphs with bounded treewidth

Cited by

• Pathwidth of outerplanar graphs
• Pathwidth [wikipedia]