Pages that link to "Item:Q2847917"
From MaRDI portal
The following pages link to Blockers for Noncrossing Spanning Trees in Complete Geometric Graphs (Q2847917):
Displaying 8 items.
- Characterization of co-blockers for simple perfect matchings in a convex geometric graph (Q368759) (← links)
- Blockers for simple Hamiltonian paths in convex geometric graphs of even order (Q724939) (← links)
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid (Q1045154) (← links)
- On the smallest sets blocking simple perfect matchings in a convex geometric graph (Q1758986) (← links)
- Blockers for triangulations of a convex polygon and a geometric maker-breaker game (Q2205124) (← links)
- Blockers for simple Hamiltonian paths in convex geometric graphs of odd order (Q2225656) (← links)
- Packing plane spanning trees and paths in complete geometric graphs (Q2628273) (← links)
- Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$ (Q5014139) (← links)