Pages that link to "Item:Q2427493"

The following pages link to Neighborhood unions and extremal spanning trees (Q2427493):

Displaying 19 items.

• Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs (Q477134) (← links)
• Spanning trees: A survey (Q659663) (← links)
• Spanning trees whose stems have a bounded number of branch vertices (Q726654) (← links)
• Spanning trees with a bounded number of branch vertices in a claw-free graph (Q742583) (← links)
• Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs (Q1045112) (← links)
• Degree sums and spanning brooms of a graph (Q2144512) (← links)
• A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
• On spanning trees with few branch vertices (Q2279263) (← links)
• Better approximation algorithms for the maximum internal spanning tree problem (Q2350897) (← links)
• Solving the maximum internal spanning tree problem on interval graphs in polynomial time (Q2636496) (← links)
• (Q2861557) (← links)
• Degree Conditions for Spanning Brooms (Q2930040) (← links)
• Minimum Degree and Dominating Paths (Q2958208) (← links)
• Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem (Q3183476) (← links)
• A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs (Q4632175) (← links)
• Spanning trees with a bounded number of leaves (Q4690981) (← links)
• Spanning Trees with Few Branch Vertices (Q5232165) (← links)
• Spectral radius and spanning trees of graphs (Q6041529) (← links)
• Spanning trees with few branch vertices in \(K_{1,4}\)-free graphs (Q6542034) (← links)