Paths with two blocks in \(k\)-chromatic digraphs
type: Item
instance of: scholarly article
title: Paths with two blocks in \(k\)-chromatic digraphs
zbMATH Open document ID: 1050.05072
published in: Discrete Mathematics
publication date: 2004-11-18T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 2116267
zbMATH Keywords: Digraph
zbMATH Keywords: Paths
zbMATH Keywords: Coloring
author: Amine El Sahili
MaRDI profile type: Publication
full work available at URL: j.disc.2004.03.013
OpenAlex ID: W2003732634
cites work: Q3900086
cites work: Functions and line digraphs
cites work: Q5545303
cites work: Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
cites work: Q3950574
cites work: Nombre chromatique et plus longs chemins d'un graphe
cites work: Paths and Cycles in Tournaments
DOI: 10.1016/J.DISC.2004.03.013
Recommended article: Paths with two blocks in \(n\)-chromatic digraphs
Recommended article: Cycles with two blocks in k‐chromatic digraphs
Recommended article: Blocks in \(k\)-connected graphs
Recommended article: Path chromatic numbers of graphs
Recommended article: Q4879610
Recommended article: Two results on the digraph chromatic number
Recommended article: On Path Partitions and Colourings in Digraphs
Recommended article: Q3172577
Recommended article: Q4294602
Recommended article: Paths containing two adjacent edges in \((2k+1)\)-edge-connected graphs
description: scientific article; zbMATH DE number 2116267