Choosing Colors for Geometric Graphs Via Color Space Embeddings

DOI10.1007/978-3-540-70904-6_29MaRDI QIDQ3595461zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A coloring algorithm for disambiguating graph and map drawings
• scientific article; zbMATH DE number 1594517
• scientific article; zbMATH DE number 1182937
• Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge
• Drawing colored graphs with constrained vertex positions and few bends per edge

Cited in

(5)

• A coloring algorithm for disambiguating graph and map drawings
• Minimum gradation in greyscales of graphs
• The maximum \(k\)-differential coloring problem
• Complexity issues in color-preserving graph embeddings
• 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)