scientific article
From MaRDI portal
Publication:3900086
zbMath0453.05022MaRDI QIDQ3900086
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (21)
Acyclic subgraphs with high chromatic number ⋮ Paths with two blocks in \(k\)-chromatic digraphs ⋮ 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 ⋮ Paths with two blocks in \(n\)-chromatic 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 ⋮ Trees in tournaments ⋮ Unnamed Item ⋮ Directed Ramsey number for trees ⋮ On the unavoidability of oriented trees ⋮ Subdivisions in digraphs of large out-degree or large dichromatic number ⋮ Dichromatic number and forced subdivisions ⋮ On three blocks paths \(P (k, l, r)\) ⋮ Acyclic subgraphs of tournaments with high chromatic number ⋮ Tournaments and Semicomplete Digraphs ⋮ Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number ⋮ On graphs with Ramsey-infinite blocks
This page was built for publication:
