Pages that link to "Item:Q5936096"

The following pages link to A sufficient condition for a graph to have a \(k\)-tree (Q5936096):

Displaying 13 items.

• Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs (Q497365) (← links)
• A \(k\)-tree containing specified vertices (Q604665) (← links)
• Degree bounded spanning trees (Q605003) (← links)
• Spanning trees: A survey (Q659663) (← links)
• Spanning trees homeomorphic to a small tree (Q898126) (← links)
• On covering vertices of a graph by trees (Q941380) (← links)
• Spanning spiders and light-splitting switches (Q1877652) (← links)
• A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) (Q2359803) (← links)
• Neighborhood unions and extremal spanning trees (Q2427493) (← links)
• (Q4393335) (← links)
• \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs (Q6204344) (← links)
• Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs (Q6611082) (← links)
• Characterizing spanning trees via the size or the spectral radius of graphs (Q6657283) (← links)