scientific article; zbMATH DE number 434863

zbMATH Open0789.05030MaRDI QIDQ3139712FDOQ3139712

Authors: E. Rivera-Campo 

Publication date: 12 June 1994

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

spanning treebounded degreesOre-type condition

Mathematics Subject Classification ID

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

Cited In (18)

• A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
• Spanning trees of bounded degree
• Spanning trees and spanning Eulerian subgraphs with small degrees
• Spanning trees: A survey
• Spanning trees with vertices having large degrees
• The number of bounded‐degree spanning trees
• Degree sum conditions for the existence of homeomorphically irreducible spanning trees
• A spanning tree with high degree vertices
• Degree conditions and degree bounded trees
• Ore's condition for completely independent spanning trees
• Spanning tree with lower bound on the degrees
• Forcing spanning subgraphs via Ore type conditions
• A toughness condition for a spanning tree with bounded total excesses
• Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs
• Degree bounded spanning trees
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• A sufficient condition for a graph to have a \(k\)-tree
• Title not available (Why is that?)

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)