On 3-coloring circle graphs

DOI10.7155/JGAA.V28I1.2991MaRDI QIDQ6636987zbMATH OpenFDO

Authors Patricia Bachmann, Ignaz Rutter, Peter Stumpf

Publication date 12 November 2024

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/JGAA.V28I1.2991

zbMATH Keywords

circle graphcoloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• The complexity of colouring circle graphs (extended abstract)
• scientific article; zbMATH DE number 4051024
• scientific article; zbMATH DE number 3970805
• scientific article; zbMATH DE number 52166
• Coloring circle graphs

Cites work

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