On covering vertices of a graph by trees

DOI10.1016/j.disc.2007.08.036zbMath1172.05047OpenAlexW2056437205MaRDI QIDQ941380

Peter Horák, K. L. McAvaney

Publication date: 4 September 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.036

zbMATH Keywords

treepathcovering vertices

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Hamiltonism, degree sum and neighborhood intersections
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• Extending Greene's theorem to directed graphs
• A note on Hamiltonian circuits
• A homology theory for spanning tress of a graph
• Paths, Stars and the Number Three
• On the largest tree of given maximum degree in a connected graph
• Some Theorems on Abstract Graphs
• A sufficient condition for a graph to have a \(k\)-tree
• Spanning trees of bounded degree

This page was built for publication: On covering vertices of a graph by trees