Treewidth of circle graphs

DOI10.1007/3-540-57568-5_240MaRDI QIDQ4268436zbMATH OpenFDO

Authors Ton Kloks

Publication date 31 October 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57568-5_240

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(10)

• Chordal embeddings of planar graphs
• Distributed interactive proofs for the recognition of some geometric intersection graph classes
• Treewidth of the generalized Kneser graphs
• Most probable explanations in Bayesian networks: complexity and tractability
• How to use the minimal separators of a graph for its chordal triangulation
• Treewidth of the \(q\)-Kneser graphs
• Leaf sector covers with applications on circle graphs
• A simple linear-time algorithm for finding path-decompositions of small width
• Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph
• The isomorphism problem for \(k\)-trees is complete for logspace

This page was built for publication: Treewidth of circle graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268436)