An explicit construction of graphs of bounded degree that are far from being Hamiltonian

Adler, I; Kohler, N

Adler, I (通讯作者)，Univ Leeds, Sch Comp, Leeds, W Yorkshire, England.

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2022; 24 (1): 1

Abstract

Full Text Link


Links

期刊讨论 | 中国SCI论文 | 期刊主页 | 投稿经验 | 杂志官网 | 投稿链接 | 作者需知 | PMC链接 | Pubmed全文检索