On 3-coloring circle graphs

DOI10.7155/jgaa.v28i1.2991MaRDI QIDQ6636987

Peter Stumpf, Patricia Bachmann, Ignaz Rutter

Publication date: 12 November 2024

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

coloringcircle graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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
• Planar graphs that need four pages
• 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