Cycles with two blocks in k‐chromatic digraphs

DOI10.1002/jgt.22232zbMath1393.05118arXiv1610.05839OpenAlexW2963955178MaRDI QIDQ4581286

Boram Park, Jie Ma, Ringi Kim, Seog-Jin Kim

Publication date: 16 August 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.05839

zbMATH Keywords

chromatic numberdigraph coloringstrongly connected digraphcycle with two blocks

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (7)

Bispindles in strongly connected digraphs with large chromatic number ⋮ Bispindle in strongly connected digraphs with large chromatic number ⋮ Existence of paths with \(t\) blocks in \(k ( t )\)-chromatic digraph ⋮ On the complexity of finding internally vertex-disjoint long directed paths ⋮ On three blocks paths \(P (k, l, r)\) ⋮ Tournaments and Semicomplete Digraphs ⋮ Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number

This page was built for publication: Cycles with two blocks in k‐chromatic digraphs