Existence of paths with \(t\) blocks in \(k ( t )\)-chromatic digraph

DOI10.1016/j.dam.2023.09.025MaRDI QIDQ6184345

Salman Ghazal, Mouhamad El Joubbeh

Publication date: 24 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic numbergirthpaths in digraphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paths with two blocks in \(n\)-chromatic digraphs
• Oriented trees in digraphs
• On three blocks paths \(P (k, l, r)\)
• Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number
• Graph Theory and Probability
• Diconnected Orientations and a Conjecture of Las Vergnas
• Cycles with two blocks in k‐chromatic digraphs
• Subdivisions of oriented cycles in digraphs with large chromatic number
• Nombre chromatique et plus longs chemins d'un graphe

This page was built for publication: Existence of paths with \(t\) blocks in \(k ( t )\)-chromatic digraph