Hamiltonian cycle problem in strong \(k\)-quasi-transitive digraphs with large diameter

DOI10.7151/dmgt.2187zbMath1458.05095OpenAlexW2903952279WikidataQ128755830 ScholiaQ128755830MaRDI QIDQ2227120

Ruixia Wang

Publication date: 10 February 2021

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2187

zbMATH Keywords

Hamiltonian cycle\(k\)-quasi-transitive digraphquasi-transitive digraph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

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

Cites Work

• 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
• On the structure of strong 3-quasi-transitive digraphs
• k‐Kings in k‐Quasitransitive Digraphs
• Unnamed Item

This page was built for publication: Hamiltonian cycle problem in strong \(k\)-quasi-transitive digraphs with large diameter