scientific article; zbMATH DE number 2044924

zbMATH Open1042.68623MaRDI QIDQ4448749FDOQ4448749

Authors: Derek G. Corneil, Udi Rotics 

Publication date: 18 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2204/22040078.htm

Title of this publication is not available (Why is that?)

Recommendations

• On the Relationship Between Clique-Width and Treewidth
• Clique-width: on the price of generality
• The relative clique-width of a graph
• From tree-decompositions to clique-width terms
• Polynomial-time recognition of clique-width \(\leq 3\) graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (12)

• On the Relationship Between Clique-Width and Treewidth
• Algorithmic uses of the Feferman-Vaught theorem
• Vertex disjoint paths on clique-width bounded graphs
• Computing the clique-width of cactus graphs
• Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
• Succinct data structure for path graphs
• From tree-decompositions to clique-width terms
• The relative clique-width of a graph
• Treewidth versus clique number in graph classes with a forbidden structure
• Title not available (Why is that?)
• Cliquewidth and knowledge compilation
• Deciding Clique-Width for Graphs of Bounded Tree-Width

This page was built for publication:

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