Degree conditions for forests in graphs

DOI10.1016/j.disc.2005.08.001zbMath1078.05020OpenAlexW2113726792MaRDI QIDQ2581630

Ajit A. Diwan, Ch. Sobhan Babu

Publication date: 10 January 2006

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

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

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (4)

Degree conditions on copies of forests in graphs ⋮ Spanning trees: A survey ⋮ Disjoint cycles with chords in graphs ⋮ Degree sum conditions for oriented forests in digraphs

Cites Work

• Subtrees and subforests of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Degree conditions for forests in graphs