Cyclically k-partite digraphs and k-kernels

DOI10.7151/DMGT.1530zbMATH Open1284.05114OpenAlexW2065844374MaRDI QIDQ3171418FDOQ3171418

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

Publication date: 5 October 2011

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

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

Recommendations

• On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs
• On the existence of kernels and \(h\)-kernels in directed graphs
• Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs
• On the existence of (k,\(\ell)\)-kernels in digraphs
• On the existence of \((k,k-1)\)-kernels in directed graphs

zbMATH Keywords

kerneldigraph\(k\)-kernel\((k,l)\)-kernelcyclically \(k\)-partite

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cited In (8)

• On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs
• On the existence of kernels and \(h\)-kernels in directed graphs
• \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs
• On the complexity of the 3-kernel problem in some classes of digraphs
• On \((2-d)\)-kernels in the Cartesian product of graphs
• \(k\)-kernels in multipartite tournaments
• On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
• Some results on 4-transitive digraphs

This page was built for publication: Cyclically \(k\)-partite digraphs and \(k\)-kernels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3171418)