Pancyclicity in strong k-quasi-transitive digraphs of large diameter

作者：

Highlights：

• A digraph in this family admits a partition into two semicomplete digraphs.

• Different cycles can be obtained by combining cycles in the parts of D.

• A hamiltonian cycle in this family can be constructed in polynomial time.

摘要

•A digraph in this family admits a partition into two semicomplete digraphs.•Different cycles can be obtained by combining cycles in the parts of D.•A hamiltonian cycle in this family can be constructed in polynomial time.

论文关键词：k-Quasi-transitive digraph,Quasi-transitive digraph,Hamiltonian cycle,Hamiltonicity,Pancyclicity

论文评审过程：Received 18 February 2021, Revised 24 April 2021, Accepted 25 April 2021, Available online 26 May 2021, Version of Record 26 May 2021.

论文官网地址：https://doi.org/10.1016/j.amc.2021.126319