Pages that link to "Item:Q1291653"
From MaRDI portal
The following pages link to Minimal spanning trees with a constraint on the number of leaves (Q1291653):
Displayed 9 items.
- On minimum degree, leaf number, traceability and Hamiltonicity in graphs (Q512550) (← links)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
- An exact algorithm for the maximum leaf spanning tree problem. (Q1413822) (← links)
- Relations, models and a memetic approach for three degree-dependent spanning tree problems (Q2255965) (← links)
- On spanning cycles, paths and trees (Q2446869) (← links)
- Minimum degree, leaf number and traceability (Q2864428) (← links)
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (Q2914198) (← links)
- Finding Totally Independent Spanning Trees with Linear Integer Programming (Q3195324) (← links)
- The Generalized Regenerator Location Problem (Q3466768) (← links)