Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter

DOI10.1016/j.amc.2021.126319MaRDI QIDQ2243313

Manuel Alejandro Juárez-Camacho, César Hernández-Cruz

Publication date: 11 November 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2021.126319

zbMATH Keywords

Hamiltonian cycle; Hamiltonicity; pancyclicity; \(k\)-quasi-transitive digraph; quasi-transitive digraph

Mathematics Subject Classification ID

05C20: Directed graphs (digraphs), tournaments

05C45: Eulerian and Hamiltonian graphs

Cites Work

• Unnamed Item
• Hamiltonian paths in \(k\)-quasi-transitive digraphs
• On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs
• \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs
• \((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs
• Hamiltonian-connected tournaments
• A linear-time algorithm for finding Hamiltonian cycles in tournaments
• On unavoidability of trees with \(k\) leaves
• Hamiltonian cycle problem in strong \(k\)-quasi-transitive digraphs with large diameter
• Tournaments and Semicomplete Digraphs
• Locally Semicomplete Digraphs and Generalizations
• Semicomplete Multipartite Digraphs
• Quasi-Transitive Digraphs and Their Extensions
• The complexity of finding generalized paths in tournaments
• Classes of Directed Graphs
• k‐Kings in k‐Quasitransitive Digraphs
• On Subtournaments of a Tournament
• Depth-First Search and Linear Graph Algorithms
• Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
• k‐quasi‐transitive digraphs of large diameter