On the existence of \((k,l)\)-kernels in infinite digraphs: a survey

DOI10.7151/dmgt.1747zbMath1292.05123MaRDI QIDQ2509534

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

Publication date: 28 July 2014

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

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

zbMATH Keywords

kernel; infinite digraph; \(k\)-kernel; \((k,l)\)-kernel

Mathematics Subject Classification ID

05C20: Directed graphs (digraphs), tournaments

05C63: Infinite graphs

Related Items

Extensions of Richardson’s theorem for infinite digraphs and (𝒜, ℬ)-kernels, Steady and ranging sets in graph persistence, Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs, Some results on 4-transitive digraphs, A new generalization of kernels in digraphs, On the existence of 3- and 4-kernels in digraphs, Fibonacci numbers in graphs with strong (1, 1, 2)-kernels, About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs, On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs, Infinite kernel perfect digraphs, Unnamed Item

Cites Work

• On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs
• \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs
• Kernels in infinite digraphs
• \(k\)-kernels in multipartite tournaments
• The strong perfect graph theorem
• On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs
• Some sufficient conditions for the existence of kernels in infinite digraphs
• Quasi-kernels and quasi-sinks in infinite graphs
• Combinatorial game theory foundations applied to digraph kernels
• Kernels in directed graphs: A poison game
• On the complexity of the 3-kernel problem in some classes of digraphs
• On the existence of \((k, l)\)-kernels in digraphs with a given circumference
• On (k,l)-kernels of special superdigraphs of P_m and C_m
• k-kernels in generalizations of transitive digraphs
• Cyclically k-partite digraphs and k-kernels
• On (k,l)-kernels in D-join of digraphs
• Graphes Noyau-Parfaits
• A sufficient condition for the existence of k-kernels in digraphs
• Quasi‐transitive digraphs
• On weakly ordered systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item