Colored Point-Set Embeddings of Acyclic Graphs
From MaRDI portal
Publication:4625132
DOI10.1007/978-3-319-73915-1_32zbMath1503.68215arXiv1708.09167OpenAlexW2751756896MaRDI QIDQ4625132
Emilio Di Giacomo, Giuseppe Liotta, Alfredo Navarra, Leszek Gąsieniec
Publication date: 20 February 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.09167
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items (5)
Relating Graph Thickness to Planar Layers and Bend Complexity ⋮ On the curve complexity of 3-colored point-set embeddings ⋮ Colored Point-Set Embeddings of Acyclic Graphs ⋮ Simultaneous embedding of colored graphs ⋮ 2-colored point-set embeddings of partial 2-trees
Cites Work
- Drawing colored graphs on colored points
- Drawing colored graphs with constrained vertex positions and few bends per edge
- The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Colored Point-Set Embeddings of Acyclic Graphs
- Point-Set Embeddability of 2-Colored Trees
- k-colored Point-set Embeddability of Outerplanar Graphs
- ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
- Embedding planar graphs at fixed vertex locations
This page was built for publication: Colored Point-Set Embeddings of Acyclic Graphs
