Spanning trees of dense directed graphs

DOI10.1016/j.entcs.2019.08.056OpenAlexW2978684563WikidataQ113317373 ScholiaQ113317373MaRDI QIDQ2132400

Tássio Naia, Richard Mycroft

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.056

zbMATH Keywords

graph theorydirected graphsspanning trees

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items (1)

Spanning trees in dense directed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximate version of Sumner's universal tournament conjecture
• Semi-degree threshold for anti-directed Hamiltonian cycles
• Proof of the bandwidth conjecture of Bollobás and Komlós
• A counterexample to a conjecture of Grant
• Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
• Spanning Trees in Dense Graphs
• Arbitrary Orientations of Hamilton Cycles in Digraphs
• Building Spanning Trees Quickly in Maker-Breaker Games
• Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
• Local resilience of almost spanning trees in random graphs
• A proof of Sumner's universal tournament conjecture for large tournaments
• An exact minimum degree condition for Hamilton cycles in oriented graphs
• Embedding large subgraphs into dense graphs
• On sets of integers containing k elements in arithmetic progression
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• Unavoidable trees in tournaments
• Proof of a Packing Conjecture of Bollobás
• Testing subgraphs in directed graphs

This page was built for publication: Spanning trees of dense directed graphs