On the largest tree of given maximum degree in a connected graph

DOI10.1002/JGT.3190150103zbMATH Open0724.05018OpenAlexW2085415738MaRDI QIDQ5202199FDOQ5202199

Authors: Yair Caro, Ilia Krasikov, Yehuda Roditty 

Publication date: 1991

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190150103

Recommendations

• Degree conditions and degree bounded trees
• Degree bounded spanning trees
• A note on a spanning 3-tree
• scientific article; zbMATH DE number 434863
• On low bound of degree sequences of spanning trees inK-edge-connected graphs

zbMATH Keywords

spanning tree

Mathematics Subject Classification ID

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

Cites Work

• Spanning trees with bounded degrees
• On the Cube of a Graph

Cited In (11)

• On covering vertices of a graph by trees
• Number of vertices of degree three in spanning 3-trees in square graphs
• Spanning trees: A survey
• Hamiltonicity and pancyclicity of generalized prisms
• Title not available (Why is that?)
• Towards the characterization of finite homomorphism-homogeneous oriented graphs with loops
• Title not available (Why is that?)
• Degree bounded spanning trees
• Existence of a spanning tree having small diameter
• Trestles in the squares of graphs
• Maximal trees with bounded maximum degree in a graph

This page was built for publication: On the largest tree of given maximum degree in a connected graph

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