zbMATH — the first resource for mathematics

Paths with two blocks in \(k\)-chromatic digraphs. (English) Zbl 1050.05072
Summary: A block of a path in a digraph is a maximal directed subpath. We prove that any \(n\)-chromatic digraph contains a path of length \(n-1\) consisting of two blocks, one of which has length one. We then study the general problem of whether an \(n\)-chromatic digraph contains a path of length \(n-1\) consisting of two blocks of specified lengths.

05C38 Paths and cycles
05C20 Directed graphs (digraphs), tournaments
05C15 Coloring of graphs and hypergraphs
Digraph; Paths; Coloring
Full Text: DOI
[1] S.A. Burr, Subtrees of directed graphs and hypergraphs, in: Proceedings of the Eleventh Southeastern Conference on Combinatorics, Graph theory and Computing, Florida Atlantic University, Boca Raton, FL, Vol. I, 28, 1980, pp. 227-239. · Zbl 0453.05022
[2] El Sahili, A., Functions and line digraphs, J. graph theory, 4, 296-303, (2003) · Zbl 1031.05058
[3] Gallai, T., On directed paths and circuits, (), 115-118 · Zbl 0159.54403
[4] Havet, F.; Thomassé, S., Oriented Hamiltonian paths in tournamentsa proof of Rosenfeld’s conjecture, J. combin. theory ser. B, 78, 2, 243-273, (2000) · Zbl 1026.05053
[5] Reid, K.B.; Wormald, N.C., Embedding oriented n-trees in tournaments, Studia sci. math. hungaria, 18, 377-387, (1983) · Zbl 0489.05026
[6] Roy, B., Nombre chromatique et plus longs chemins d’un graphe, Rev. française automat. informat. recherche opérationelle Sér. rouge, 1, 127-132, (1967) · Zbl 0157.31302
[7] Thomason, A., Paths and cycles in tournaments, Trans. amer. math. soc., 296, 167-180, (1986) · Zbl 0599.05026
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.