当前位置:
X-MOL 学术
›
Discret. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Long cycles through specified vertices
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-01-09 , DOI: 10.1016/j.disc.2020.112274 Shuchao Li , Xuechao Li , Bing Wei
中文翻译:
通过指定顶点的长周期
更新日期:2021-01-10
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-01-09 , DOI: 10.1016/j.disc.2020.112274 Shuchao Li , Xuechao Li , Bing Wei
Let for a graph and an integer . In 1991, Egawa et al. (1991) generalized a famous result on the existence of a hamiltonian cycle given by Ore (1960). In this paper, we will enhance the result of Egawa et al.. by providing the following result: Let be a -connected graph () and let be an any vertex set with . Then has a cycle of length at least passing through .
中文翻译:
通过指定顶点的长周期
让 对于图 和一个整数 。1991年,Egawa等人。(1991)对由Ore(1960)给出的哈密顿循环的存在给出了著名的结论。在本文中,我们将通过提供以下结果来增强Egawa等人的结果: 成为 连接图() 然后让 与任何顶点集 。然后 具有至少一个长度的周期 通过 。