Long Cycles in Chromatic Digraphs Spanned by Hamiltonian Directed Paths

Mathematics 2026 Open access

Read full text
Authors: Salman Ghazal, Nadine Dirani
DOI: 10.3390/math14111979
Cited by: 1
References: 25

Abstract

Let C be any oriented cycle on n vertices. We show that every (10n−4)-chromatic digraph spanned by a Hamiltonian directed path contains a subdivision of C.

Fields of Study & Subjects

Advanced Graph Theory Research Limits and Structures in Graph Theory graph theory and CDMA systems

Publication details

Journal / source
Mathematics
Publisher
MDPI AG
Volume
14
Issue
11
Pages
1979–1979
Publication date
3 June 2026
Language
EN