TREEWIDTH OF CIRCLE GRAPHS

DOI10.1142/S0129054196000099MaRDI QIDQ4886311zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ton Kloks

Publication date 26 November 1996

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054196000099

zbMATH Keywords

circle graphtreewidth

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Treewidth of Circular-Arc Graphs
• Recognizing circle graphs in polynomial time
• Treewidth of Chordal Bipartite Graphs
• scientific article; zbMATH DE number 512817

Cited in

(18)

• Treewidth for graphs with small chordality
• Fugitive-search games on graphs and related parameters
• Triangulating multitolerance graphs
• Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
• A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
• Parameterized domination in circle graphs
• A revisit of the scheme for computing treewidth and minimum fill-in
• Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
• On the maximum weight minimal separator
• Pathwidth of Circular-Arc Graphs
• The Branch-Width of Circular-Arc Graphs
• Treewidth of Circular-Arc Graphs
• Tree-width and circumference of graphs
• scientific article; zbMATH DE number 7236457 (Why is no real title available?)
• Pathwidth is NP-Hard for Weighted Trees
• Treewidth, Circle Graphs, and Circular Drawings
• A (1.5+)-approximation algorithm for weighted connectivity augmentation
• Treewidth, circle graphs and circular drawings

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