The existence of \(f\)-forests and \(f\)-trees in graphs

DOI10.1016/j.dam.2018.07.005zbMath1404.05028OpenAlexW2887226922MaRDI QIDQ1720317

Michitaka Furuya, Takamasa Yashima

Publication date: 8 February 2019

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

Full work available at URL: https://doi.org/10.1016/j.dam.2018.07.005

zbMATH Keywords

degree-sum condition\(f\)-forest\(f\)-tree

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• Hamilton connected graphs
• On a \(k\)-tree containing specified leaves in a graph
• On a connection between the existence of k-trees and the toughness of a graph
• On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)
• Connected (g, f)-factors
• Note on Hamilton Circuits
• Unnamed Item

This page was built for publication: The existence of \(f\)-forests and \(f\)-trees in graphs