scientific article; zbMATH DE number 434863

MaRDI QIDQ3139712zbMATH OpenFDO

Authors E. Rivera-Campo

Publication date 12 June 1994

zbMATH Keywords

bounded degreesOre-type conditionspanning tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• Degree bounded spanning trees
• Spanning trees with bounded degrees
• On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)
• Spanning trees of bounded degree
• A sufficient condition for a graph to have a k-tree

Cited in

(21)

• Degree conditions and degree bounded trees
• Spanning trees with bounded degrees
• Spanning tree with lower bound on the degrees
• Spanning trees and spanning Eulerian subgraphs with small degrees
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• Forcing spanning subgraphs via Ore type conditions
• A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
• Ore's condition for completely independent spanning trees
• On low bound of degree sequences of spanning trees inK-edge-connected graphs
• Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs
• A toughness condition for a spanning tree with bounded total excesses
• On the largest tree of given maximum degree in a connected graph
• Spanning trees with vertices having large degrees
• scientific article; zbMATH DE number 5174840 (Why is no real title available?)
• A sufficient condition for a graph to have a k-tree
• Spanning trees of bounded degree
• A spanning tree with high degree vertices
• Degree bounded spanning trees
• Degree sum conditions for the existence of homeomorphically irreducible spanning trees
• The number of bounded‐degree spanning trees
• Spanning trees: A survey

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139712)