Oriented trees in digraphs
From MaRDI portal
Publication:1946667
DOI10.1016/j.disc.2013.01.011zbMath1262.05066OpenAlexW2114702003MaRDI QIDQ1946667
Louigi Addario-Berry, Cláudia Linhares Sales, Frédéric Havet, Bruce A. Reed, Steéphan Thomassé
Publication date: 15 April 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.01.011
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (17)
Acyclic subgraphs with high chromatic number ⋮ Trees contained in every orientation of a graph ⋮ Bispindles in strongly connected digraphs with large chromatic number ⋮ A Ramsey type result for oriented trees ⋮ Bispindle in strongly connected digraphs with large chromatic number ⋮ Antipaths in oriented graphs ⋮ Existence of paths with \(t\) blocks in \(k ( t )\)-chromatic digraph ⋮ Graph coloring approach with new upper bounds for the chromatic number: team building application ⋮ Subdivisions of four blocks cycles in digraphs with large chromatic number ⋮ Directed Ramsey number for trees ⋮ Oriented bipartite graphs and the Goldbach graph ⋮ Subdivisions in digraphs of large out-degree or large dichromatic number ⋮ Every orientation of a 4-chromatic graph has a non-bipartite acyclic subgraph ⋮ All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight) ⋮ On three blocks paths \(P (k, l, r)\) ⋮ Acyclic subgraphs of tournaments with high chromatic number ⋮ Tournaments and Semicomplete Digraphs
This page was built for publication: Oriented trees in digraphs
