Paths with two blocks in \(n\)-chromatic digraphs

DOI10.1016/j.jctb.2006.10.001zbMath1119.05049OpenAlexW2143815444MaRDI QIDQ885298

Steéphan Thomassé, Louigi Addario-Berry, Frédéric Havet

Publication date: 8 June 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2006.10.001

zbMATH Keywords

oriented path\(n\)-chromatic digraphunavoidable digraphuniversal digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (11)

Trees contained in every orientation of a graph ⋮ Bispindles in strongly connected digraphs with large chromatic number ⋮ The existence of a path with two blocks in digraphs ⋮ Unnamed Item ⋮ Existence of paths with \(t\) blocks in \(k ( t )\)-chromatic digraph ⋮ Subdivisions of four blocks cycles in digraphs with large chromatic number ⋮ Unnamed Item ⋮ Directed Ramsey number for trees ⋮ On three blocks paths \(P (k, l, r)\) ⋮ Tournaments and Semicomplete Digraphs ⋮ Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number

Cites Work

• Unnamed Item
• Unnamed Item
• Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
• Paths with two blocks in \(k\)-chromatic digraphs
• Graph Theory and Probability
• On the existence of specified cycles in a tournament
• Diconnected Orientations and a Conjecture of Las Vergnas
• Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
• About paths with two blocks
• Nombre chromatique et plus longs chemins d'un graphe
• Trees in tournaments
• Trees in tournaments

This page was built for publication: Paths with two blocks in \(n\)-chromatic digraphs