scientific article

zbMath1274.05196MaRDI QIDQ2857428

Richard Mycroft, Deryk Osthus, Daniela Kühn

Publication date: 1 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311001818

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Trees contained in every orientation of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximate version of Sumner's universal tournament conjecture
• Hamiltonian degree sequences in digraphs
• On unavoidability of trees with \(k\) leaves
• Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
• Trees with three leaves are (\(n+1\))-unavoidable
• A proof of Sumner's universal tournament conjecture for large tournaments
• Embedding large subgraphs into dense graphs
• Paths and Cycles in Tournaments
• Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
• Trees in tournaments
• Trees in tournaments
• Testing subgraphs in directed graphs
• Trees in tournaments

This page was built for publication: