On 3-coloring circle graphs

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

Peter Stumpf, Patricia Bachmann, Ignaz Rutter

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
• Embedding planar graphs in four pages
• Simpler algorithms for testing two-page book embedding of partitioned graphs
• The book thickness of 1-planar graphs is constant
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• The complexity of colouring circle graphs
• Four pages are indeed necessary for planar graphs
• Graph-Theoretic Concepts in Computer Science

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