Cohen et al. conjectured that for each oriented cycle C , there is a smallest positive integer f ( C ) such that every f ( C )-chromatic strong digraph contains a subdivision of C . Let C be an oriented cycle on n vertices. For the class of Hamiltonian digraphs, El Joubbeh proved that f ( C ) <= 3n . In this paper, we improve El Joubbeh's result by showing that f( C ) <= 2n for the class of Hamiltonian digraphs.
机构:
Lebanese Univ, Fac Sci 1, Dept Math, KALMA Lab, Hadath, Lebanon
Claude Bernard Univ Lyon 1, Camille Jordan Inst, Dept Math, Villeurbanne, FranceLebanese Univ, Fac Sci 1, Dept Math, KALMA Lab, Hadath, Lebanon
机构:
Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Peoples R ChinaXinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Peoples R China
Yang, Hong
Liu, Juan
论文数: 0引用数: 0
h-index: 0
机构:
Guizhou Univ Finance & Econ, Coll Big Data Stat, Guiyang 550025, Peoples R ChinaXinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Peoples R China
Liu, Juan
Meng, Jixiang
论文数: 0引用数: 0
h-index: 0
机构:
Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Peoples R ChinaXinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Peoples R China