Choosing Colors for Geometric Graphs Via Color Space Embeddings

DOI10.1007/978-3-540-70904-6_29zbMATH Open1185.68467OpenAlexW1638773353MaRDI QIDQ3595461FDOQ3595461

Michael B. Dillencourt, David Eppstein, Michael T. Goodrich

Publication date: 28 August 2007

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70904-6_29

zbMATH Keywords

graph coloringgraph drawingcolor perceptioncolor space

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cited In (4)

• Complexity issues in color-preserving graph embeddings
• The maximum \(k\)-differential coloring problem
• Minimum gradation in greyscales of graphs
• Contrast in greyscales of graphs

This page was built for publication: Choosing Colors for Geometric Graphs Via Color Space Embeddings

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