任意色数有向图中的有向哈密顿路径

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics Pub Date : 2025-05-04 DOI:10.1016/j.dam.2025.04.050

Ayman El Zein

引用次数: 0

摘要

Roy-Gallai定理指出每个n色有向图都包含一条n阶有向图的有向路径。几个结果提供了保证有向图中有向路径存在的色数的必要条件。本文证明了任意色数n≥8的有向图包含所有有向哈密顿路径的存在性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Oriented Hamiltonian paths in digraphs with arbitrary chromatic number

The Roy–Gallai theorem states that every

n

-chromatic digraph contains a directed path of order

n

. Several results have provided necessary conditions concerning the chromatic number to guarantee the existence of paths in digraphs. In this paper, we prove the existence of digraphs with an arbitrary chromatic number

n \geq 8

containing every oriented Hamiltonian path.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discrete Applied Mathematics 数学-应用数学

CiteScore

2.30

自引率

9.10%

发文量

422

审稿时长

4.5 months

期刊介绍： The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.