\(k\)-ary spanning trees contained in tournaments

DOI10.1016/j.dam.2020.04.028zbMath1447.05053arXiv1803.09880OpenAlexW3035580488MaRDI QIDQ2197413

Yongtang Shi, Jiangdong Ai, Zan-Bo Zhang, Hui Lei, Shunyu Yao

Publication date: 31 August 2020

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

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

zbMATH Keywords

tournamentsdomination number\(k\)-ary spanning treesmaximum out-degree

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Claws contained in all \(n\)-tournaments
• Largest digraphs contained in all n-tournaments
• On finding a minimum dominating set in a tournament
• Antidirected Hamiltonian circuits in tournaments
• On avoidable and unavoidable claws
• Paths and Cycles in Tournaments
• Onk-ary spanning trees of tournaments
• On a Problem in Graph Theory
• Trees in tournaments
• Trees in tournaments
• Antidirected Hamiltonian paths in tournaments