Spanning trees and spanning closed walks with small degrees

DOI10.1016/j.disc.2022.112998zbMath1491.05052arXiv1702.06203OpenAlexW3154799494MaRDI QIDQ2144593

Morteza Hasanvand

Publication date: 14 June 2022

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

Full work available at URL: https://arxiv.org/abs/1702.06203

zbMATH Keywords

matchingspanning treetoughnessconnected factorspanning closed walk

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning trees: A survey
• On 2-connected spanning subgraphs with bounded degree in \(K _{1,r }\)-free graphs
• Elementary graphs with respect to \(f\)-parity factors
• On factors with all degrees odd
• On a connection between the existence of k-trees and the toughness of a graph
• Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor
• A note on matchings and spanning trees with bounded degrees
• Spanning trees and spanning Eulerian subgraphs with small degrees
• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• Connected (g, f)-factors
• Toughness and the existence ofk-factors
• Some results on odd factors of graphs
• On low bound of degree sequences of spanning trees inK-edge-connected graphs
• Toughness, trees, and walks

This page was built for publication: Spanning trees and spanning closed walks with small degrees