\((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs

DOI10.1016/j.disc.2014.08.009zbMath1301.05152OpenAlexW2066061637MaRDI QIDQ468446

Ruixia Wang

Publication date: 7 November 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.08.009

zbMATH Keywords

\(k\)-quasi-transitive digraphquasi-transitive digraph\(k\)-king\(k\)-kernel

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Hamiltonian paths in \(k\)-quasi-transitive digraphs ⋮ \(k\)-quasi-transitive digraphs of large diameter ⋮ k‐quasi‐transitive digraphs of large diameter ⋮ On the existence of 3- and 4-kernels in digraphs ⋮ Hamiltonian cycle problem in strong \(k\)-quasi-transitive digraphs with large diameter ⋮ Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter ⋮ Quasi-Transitive Digraphs and Their Extensions

Cites Work

• Unnamed Item
• On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs
• \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs
• On the structure of strong 3-quasi-transitive digraphs
• Kings in quasi-transitive digraphs
• Kings in multipartite tournaments
• Number of 4-kings in bipartite tournaments with no 3-kings
• Perfect graphs, kernels, and cores of cooperative games
• 4-transitive digraphs I: the structure of strong 4-transitive digraphs
• k-kernels in generalizations of transitive digraphs
• Kings in locally semicomplete digraphs
• Kings in semicomplete multipartite digraphs
• k‐Kings in k‐Quasitransitive Digraphs

This page was built for publication: \((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs