Recommendations
Cites work
- scientific article; zbMATH DE number 5485473 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
- Algorithms and Computation
- Crossing Number is NP-Complete
- Crossing number is hard for cubic graphs
- How to draw a planar graph on a grid
- On the convex layers of a planar set
- Planar bichromatic minimum spanning trees
Cited in
(11)- Short plane supports for spatial hypergraphs
- On the Red/Blue Spanning Tree Problem
- Geometric spanning cycles in bichromatic point sets
- On the number of intersections of three monochromatic trees in the plane
- Planar bichromatic bottleneck spanning trees
- Geometric planar networks on bichromatic collinear points
- Planar Bichromatic Bottleneck Spanning Trees
- Colored spanning graphs for set visualization
- Colored spanning graphs for set visualization
- Short plane supports for spatial hypergraphs
- Faster algorithms for the minimum red-blue-purple spanning graph problem
This page was built for publication: On the red/blue spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534557)