The existence of spanning ended system on claw-free graphs

DOI10.1155/2016/6041841zbMath1400.05180OpenAlexW2522198457WikidataQ59131786 ScholiaQ59131786MaRDI QIDQ1793386

Meijin Xu, Yan-Jun Liu, Xiao Dong Chen

Publication date: 12 October 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2016/6041841

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Spanning trees with a bounded number of branch vertices in a claw-free graph
• On a closure concept in claw-free graphs
• Number of spanning trees of different products of complete and complete bipartite graphs
• Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems
• Closure and stable Hamiltonian properties in claw-free graphs
• Closure, 2-factors, and cycle coverings in claw-free graphs
• Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms

This page was built for publication: The existence of spanning ended system on claw-free graphs