scientific article; zbMATH DE number 4210186

zbMATH Open0732.05046MaRDI QIDQ3358765FDOQ3358765

Authors: Petra Scheffler 

Publication date: 1990

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

Recommendations

• scientific article; zbMATH DE number 772777
• scientific article; zbMATH DE number 3968629
• Graph minors. II. Algorithmic aspects of tree-width
• Publication:4734761
• scientific article; zbMATH DE number 4060712

zbMATH Keywords

intersection graphsinterval graphschordal graphspolynomial- time algorithmsouter-planar graphsstructural investigations of graphs with bounded tree-width

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)

Cited In (16)

• Tree-width dichotomy
• Precoloring extension. I: Interval graphs
• Treewidth versus clique number. II: Tree-independence number
• The tree- and clique-width of bipartite graphs in special classes
• Orthogonal tree decompositions of graphs
• Title not available (Why is that?)
• Tree-decompositions of small pathwidth
• Treewidth of Circular-Arc Graphs
• Title not available (Why is that?)
• On the number of labeled graphs of bounded treewidth
• On the ?largeur d'arborescence?
• Title not available (Why is that?)
• Treewidth versus clique number. I: Graph classes with a forbidden structure
• Tree-Width and Optimization in Bounded Degree Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

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 Q3358765)