On covering vertices of a graph by trees

DOI10.1016/J.DISC.2007.08.036MaRDI QIDQ941380zbMATH OpenOpenAlexFDO

Authors 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

covering verticespathtree

Mathematics Subject Classification ID

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

Recommendations

• Covering planar graphs with forests
• Maximum and minimum degree conditions for embedding trees
• Covering the edges of a graph by a prescribed tree with minimum overlap
• Degree Sums and Covering Cycles
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

Cites work

• A homology theory for spanning tress of a graph
• A note on Hamiltonian circuits
• A sufficient condition for a graph to have a k-tree
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• Extending Greene's theorem to directed graphs
• Hamiltonism, degree sum and neighborhood intersections
• scientific article; zbMATH DE number 3165195 (Why is no real title available?)
• scientific article; zbMATH DE number 3603293 (Why is no real title available?)
• On the largest tree of given maximum degree in a connected graph
• Paths, Stars and the Number Three
• Some Theorems on Abstract Graphs
• Spanning trees of bounded degree

Cited in

(15)

• Vertex coverings by monochromatic cycles and trees
• Covering the edges of a graph by a prescribed tree with minimum overlap
• Covering planar graphs with forests
• A constructive characterization of vertex cover Roman trees
• On the tree cover number of a graph
• scientific article; zbMATH DE number 5952201 (Why is no real title available?)
• scientific article; zbMATH DE number 5003360 (Why is no real title available?)
• scientific article; zbMATH DE number 5775505 (Why is no real title available?)
• Decomposition of graphs into internally disjoint trees
• scientific article; zbMATH DE number 68550 (Why is no real title available?)
• scientific article; zbMATH DE number 1556750 (Why is no real title available?)
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Approximating the tree and tour covers of a graph
• Min-max tree covers of graphs.
• Two fixed-parameter algorithms for vertex covering by paths on trees

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

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