Revisiting circular arc graphs

DOI10.1007/3-540-58325-4_223MaRDI QIDQ4525749zbMATH OpenFDO

Authors Lin Chen, Lin Chen

Publication date 24 January 2001

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

Full work available at URL https://doi.org/10.1007/3-540-58325-4_223

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(3)

• Optimal circular arc representations: Properties, recognition, and construction
• OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS
• Efficient parallel recognition of some circular arc graphs. II

This page was built for publication: Revisiting circular arc graphs

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