Pages that link to "Item:Q714896"
From MaRDI portal
The following pages link to A sufficient condition for the existence of plane spanning trees on geometric graphs (Q714896):
Displaying 6 items.
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- On geometric independency trees for points in the plane (Q1850043) (← links)
- Compatible spanning trees (Q2444309) (← links)
- A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph (Q2502039) (← links)
- Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon (Q2798020) (← links)
- Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$ (Q5014139) (← links)