Skip to main content

Treewidth and pathwidth of cocomparability graphs of bounded dimension

  • Chapter
  • First Online:
Treewidth

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 842))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Editor information

Ton Kloks

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(1994). Treewidth and pathwidth of cocomparability graphs of bounded dimension. In: Kloks, T. (eds) Treewidth. Lecture Notes in Computer Science, vol 842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045387

Download citation

  • DOI: https://doi.org/10.1007/BFb0045387

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58356-1

  • Online ISBN: 978-3-540-48672-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics