Skip to main content
Article thumbnail
Location of Repository

Pathwidth of planar and line graphs

By Fedor V. Fomin


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) ^ pathwidth(H\Lambda) + 1 for every planar triangulation H and leads us to a conjecture that pathwidth(G) ^ pathwidth(G\Lambda) + 1 for every 2-connected graph G

Year: 2001
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.