\(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs

DOI10.1016/j.disc.2012.05.005zbMath1246.05067OpenAlexW2032637173MaRDI QIDQ442356

Hortensia Galeana-Sánchez, César Hernández-Cruz

Publication date: 10 August 2012

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

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

zbMATH Keywords

digraphkernelquasi-transitive digraphtransitive digraph(\(k-\ell\))-kernel\(k\)-kernel

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (22)

Hamiltonian paths in \(k\)-quasi-transitive digraphs ⋮ \(k\)-quasi-transitive digraphs of large diameter ⋮ On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs ⋮ \((H, k)\)-reachability in \(H\)-arc-colored digraphs ⋮ k‐quasi‐transitive digraphs of large diameter ⋮ On the existence of 3- and 4-kernels in digraphs ⋮ A note on Seymour's second neighborhood conjecture ⋮ Seymour's second neighborhood conjecture for 5-anti-transitive oriented graphs ⋮ On the complexity of the 3-kernel problem in some classes of digraphs ⋮ \((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs ⋮ Some remarks on the structure of strong \(k\)-transitive digraphs ⋮ Seymour's second neighborhood conjecture for 6-antitransitive digraphs ⋮ Hamiltonian cycle problem in strong \(k\)-quasi-transitive digraphs with large diameter ⋮ Seymour's second neighborhood conjecture for \(m\)-free, \(k\)-transitive, \(k\)-anti-transitive digraphs and some approaches ⋮ Some results on 4-transitive digraphs ⋮ Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter ⋮ On the existence of \((k,l)\)-kernels in infinite digraphs: a survey ⋮ Unnamed Item ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ Miscellaneous Digraph Classes ⋮ k‐Kings in k‐Quasitransitive Digraphs ⋮ \((k-1)\)-kernels in strong \(k\)-transitive digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The radii of n-partite tournaments
• Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs
• \(k\)-kernels in multipartite tournaments
• On the structure of strong 3-quasi-transitive digraphs
• On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs
• Kings in \(k\)-partite tournaments
• On \((k,l)\)-kernels in generalized products
• Kings in quasi-transitive digraphs
• The structure of strong arc-locally semicomplete digraphs
• Kings in multipartite tournaments
• Perfect graphs, kernels, and cores of cooperative games
• On the 3-kings and 4-kings in multipartite tournaments
• 3-kings in 3-partite tournaments
• Kernels in quasi-transitive digraphs
• k-kernels in generalizations of transitive digraphs
• Cyclically k-partite digraphs and k-kernels
• On (k,l)-kernels in D-join of digraphs
• Quasi‐transitive digraphs
• Kings in semicomplete multipartite digraphs

This page was built for publication: \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs