On 3-coloring circle graphs

DOI10.1007/978-3-031-49272-3_11MaRDI QIDQ6560146FDO

Authors Patricia Bachmann, Ignaz Rutter, Peter Stumpf

Publication date 21 June 2024

zbMATH Keywords

graph coloringbook embeddingcircle graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• scientific article; zbMATH DE number 4051024 (Why is no real title available?)
• scientific article; zbMATH DE number 52166 (Why is no real title available?)
• scientific article; zbMATH DE number 2159655 (Why is no real title available?)
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Embedding planar graphs in four pages
• Four pages are indeed necessary for planar graphs
• Graph-Theoretic Concepts in Computer Science
• Simpler algorithms for testing two-page book embedding of partitioned graphs
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
• The complexity of colouring circle graphs (extended abstract)

This page was built for publication: On 3-coloring circle graphs

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