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

DOI10.1002/JGT.3190150103MaRDI QIDQ5202199zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

spanning tree

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(11)

• Maximal trees with bounded maximum degree in a graph
• Trestles in the squares of graphs
• Existence of a spanning tree having small diameter
• Number of vertices of degree three in spanning 3-trees in square graphs
• Hamiltonicity and pancyclicity of generalized prisms
• scientific article; zbMATH DE number 4103101 (Why is no real title available?)
• scientific article; zbMATH DE number 1465679 (Why is no real title available?)
• Towards the characterization of finite homomorphism-homogeneous oriented graphs with loops
• Degree bounded spanning trees
• Spanning trees: A survey
• On covering vertices of a graph by trees

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)