Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
From MaRDI portal
Publication:4521493
DOI<244::AID-JGT2>3.0.CO;2-H 10.1002/1097-0118(200012)35:4<244::AID-JGT2>3.0.CO;2-HzbMath0969.05029OpenAlexW4243493907MaRDI QIDQ4521493
Frédéric Havet, Steéphan Thomassé
Publication date: 30 September 2001
Full work available at URL: https://doi.org/10.1002/1097-0118(200012)35:4<244::aid-jgt2>3.0.co;2-h
Related Items (32)
Pair dominating graphs ⋮ Trees with few leaves in tournaments ⋮ Seymour's Second Neighborhood Conjecture for Tournaments Missing a Generalized Star ⋮ A Ramsey type result for oriented trees ⋮ A contribution to the second neighborhood problem ⋮ Paths with two blocks in \(n\)-chromatic digraphs ⋮ The second out-neighborhood for local tournaments ⋮ Seymour's second neighborhood conjecture for orientations of (pseudo)random graphs ⋮ Vertices with the second neighborhood property in Eulerian digraphs ⋮ On Seymour's and Sullivan's second neighbourhood conjectures ⋮ The Second Neighborhood Conjecture for Oriented Graphs Missing $\{C_{4}, \overline{C_{4}}, S_{3},$ chair and co-chair$\}$-Free Graph ⋮ A note on Seymour's second neighborhood conjecture ⋮ Seymour's second neighborhood conjecture for 5-anti-transitive oriented graphs ⋮ The second neighbourhood for bipartite tournaments ⋮ An approximate version of Sumner's universal tournament conjecture ⋮ A graph-theoretic approach for comparing dimensions of components in simply-graded algebras ⋮ Seymour's second neighborhood conjecture for \(m\)-free, \(k\)-transitive, \(k\)-anti-transitive digraphs and some approaches ⋮ Trees in tournaments ⋮ Claws in digraphs ⋮ Unnamed Item ⋮ Directed Ramsey number for trees ⋮ The second neighbourhood for quasi-transitive oriented graphs ⋮ On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity ⋮ On the unavoidability of oriented trees ⋮ On the unavoidability of oriented trees ⋮ Unnamed Item ⋮ The Arc‐Weighted Version of the Second Neighborhood Conjecture ⋮ Trees with three leaves are (\(n+1\))-unavoidable ⋮ Extending some results on the second neighborhood conjecture ⋮ Tournaments and Semicomplete Digraphs ⋮ A Remark on the Second Neighborhood Problem ⋮ About the second neighborhood problem in tournaments missing disjoint stars
Cites Work
This page was built for publication: Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
