Drawing Colored Graphs on Colored Points

DOI10.1007/978-3-540-73951-7_10zbMath1209.05061OpenAlexW2161240755MaRDI QIDQ3603518

Melanie Badent, Emilio Di Giacomo, Giuseppe Liotta

Publication date: 17 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_10

zbMATH Keywords

crossing free drawing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

IMPROVED ALGORITHMS FOR THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE 3-TREES ⋮ Point-set embeddings of trees with given partial drawings ⋮ Drawing colored graphs on colored points ⋮ Drawing colored graphs with constrained vertex positions and few bends per edge ⋮ Embeddability Problems for Upward Planar Digraphs

This page was built for publication: Drawing Colored Graphs on Colored Points