Vertex-colored encompassing graphs
From MaRDI portal
Publication:742604
DOI10.1007/s00373-013-1320-1zbMath1298.05120OpenAlexW2083530426MaRDI QIDQ742604
Publication date: 19 September 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1320-1
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (4)
Plane bichromatic trees of low degree ⋮ Discrete geometry on colored point sets in the plane -- a survey ⋮ Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane ⋮ Linear transformation distance for bichromatic matchings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relative convex hulls in semi-dynamic arrangements
- Pointed binary encompassing trees: simple and optimal
- Constructing plane spanners of bounded degree and low weight
- Simple alternating path problem
- Alternating paths through disjoint line segments
- A vertex-face assignment for plane graphs
- Planar bichromatic minimum spanning trees
- Generalized Delaunay triangulation for planar graphs
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Segment endpoint visibility graphs are Hamiltonian
- Encompassing colored planar straight line graphs
- Euclidean shortest paths in the presence of rectilinear barriers
- ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
- Growing a Tree from Its Branches
- Every set of disjoint line segments admits a binary tree
This page was built for publication: Vertex-colored encompassing graphs
