On 3-coloring circle graphs
From MaRDI portal
Publication:6560146
DOI10.1007/978-3-031-49272-3_11MaRDI QIDQ6560146FDOQ6560146
Authors: Patricia Bachmann, Ignaz Rutter, Peter Stumpf 
Publication date: 21 June 2024
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Embedding planar graphs in four pages
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Graph-Theoretic Concepts in Computer Science
- Title not available (Why is that?)
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of colouring circle graphs (extended abstract)
- The book thickness of 1-planar graphs is constant
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- Four pages are indeed necessary for planar graphs
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)
