Maximum plane trees in multipartite geometric graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(15)- Euclidean maximum matchings in the plane -- local to global
- Graph Drawing
- Planar bichromatic bottleneck spanning trees
- Maximum plane trees in multipartite geometric graphs
- Noncrossing longest paths and cycles
- Planar Bichromatic Bottleneck Spanning Trees
- Geometric planar networks on bichromatic points
- Minimum plane bichromatic spanning trees
- Euclidean maximum matchings in the plane -- local to global
- Minimum plane bichromatic spanning trees
- An optimal algorithm for plane matchings in multipartite geometric graphs
- Noncrossing longest paths and cycles
- Long plane trees
- Two trees in maximal planar bipartite graphs
- Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
This page was built for publication: Maximum plane trees in multipartite geometric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5915987)