Pages that link to "Item:Q5232165"
From MaRDI portal
The following pages link to Spanning Trees with Few Branch Vertices (Q5232165):
Displaying 14 items.
- Bounded-degree spanning tree problems: models and new algorithms (Q632386) (← links)
- Arbres avec un nombre maximum de sommets pendants (Q793746) (← links)
- Spanning trees whose stems are spiders (Q897247) (← links)
- Snarks with special spanning trees (Q1733867) (← links)
- The generalized minimum branch vertices problem: properties and polyhedral analysis (Q2031951) (← links)
- Matchings with few colors in colored complete graphs and hypergraphs (Q2305937) (← links)
- Approximating spanning trees with few branches (Q2344216) (← links)
- Conditions for spanning trees whose internal subtrees have few branch vertices and leaves (Q2693743) (← links)
- Low degree spanning trees of small weight (Q2817632) (← links)
- Degree Conditions for Spanning Brooms (Q2930040) (← links)
- (Q4437490) (← links)
- (Q4982929) (← links)
- (Q5244007) (← links)
- An improvement on Łuczak's connected matchings method (Q6133269) (← links)