On Subdivision of Cycles with Two Blocks in Chromatic Digraphs Spanned by Hamiltonian Directed Paths
Abstract
Let C be an oriented cycle with two blocks and let n denote the number of its vertices. We show that every (n+2)-chromatic digraph spanned by a Hamiltonian directed path contains a subdivision of C. This bound is tight.
Fields of Study & Subjects
Limits and Structures in Graph Theory
graph theory and CDMA systems
Advanced Graph Theory Research
Publication details
- Journal / source
- Mathematics
- Publisher
- MDPI AG
- Volume
- 14
- Issue
- 8
- Pages
- 1248–1248
- Publication date
- 9 April 2026
- Language
- EN