Graphs with only caterpillars as spanning trees

DOI10.1016/S0012-365X(03)00186-9zbMath1029.05034OpenAlexW2067361875MaRDI QIDQ1415546

Henry Martyn Mulder, Robert E. Jamison, Fred R. McMorris

Publication date: 4 December 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00186-9

zbMATH Keywords

Spanning treeCaterpillar

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

THE DEGREE PROFILE AND GINI INDEX OF RANDOM CATERPILLAR TREES ⋮ Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs

Cites Work

• Parallel concepts in graph theory
• On the average number of nodes in a subtree of a tree

This page was built for publication: Graphs with only caterpillars as spanning trees