The Branch-Width of Circular-Arc Graphs

DOI10.1007/11682462_66MaRDI QIDQ3525805zbMATH OpenOpenAlexFDO

Authors Frédéric Mazoit

Publication date 18 September 2008

Published in LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11682462_66

zbMATH Keywords

algorithmbranch-widthcircular-arc graphs

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Treewidth of Circular-Arc Graphs
• Pathwidth of Circular-Arc Graphs
• TREEWIDTH OF CIRCLE GRAPHS
• Branchwidth of chordal graphs
• Tree-width and circumference of graphs
• The branchwidth of graphs and their cycle matroids
• The restricted arc-width of a graph
• Partial characterizations of circular-arc graphs
• Partial Characterizations of Circular-Arc Graphs
• On some subclasses of circular-arc graphs

Cited in

(4)

• Constructing Brambles
• Tangle bases: Revisited
• A constant factor approximation algorithm for boxicity of circular arc graphs
• Computing branchwidth via efficient triangulations and blocks

This page was built for publication: The Branch-Width of Circular-Arc Graphs

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