2-colored point-set embeddings of partial 2-trees
From MaRDI portal
Publication:5919105
DOI10.1007/978-3-030-68211-8_20OpenAlexW3130551510MaRDI QIDQ5919105
Giuseppe Liotta, Emilio Di Giacomo, Jaroslav Hančl Jr.
Publication date: 4 October 2021
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-68211-8_20
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple alternating path problem
- Drawing colored graphs on colored points
- Bipartite embeddings of trees in the plane
- The rooted tree embedding problem into points in the plane
- On Hamiltonian alternating cycles and paths
- Track layouts, layered path decompositions, and leveled planarity
- On a straight-line embedding problem of graphs
- Hamiltonian orthogeodesic alternating paths
- On point set embeddings for \(k\)-planar graphs with few bends per edge
- Computing NodeTrix Representations of Clustered Graphs
- CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS
- Optimal Algorithms to Embed Trees in a Point Set
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Colored Point-Set Embeddings of Acyclic Graphs
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
- k-colored Point-set Embeddability of Outerplanar Graphs
- Intersection-Link Representations of Graphs
- ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
- Embedding planar graphs at fixed vertex locations
This page was built for publication: 2-colored point-set embeddings of partial 2-trees
