Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs (Q299098): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2015.05.037
@@ Property / DOI: 10.1016/j.dam.2015.05.037 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2015.05.037
+Normal rank
@@ Property / OpenAlex ID @@
+W1050290852
@@ Property / OpenAlex ID: W1050290852 / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\)
+Normal rank
@@ Property / cites work @@
+Q5672929
@@ Property / cites work: Q5672929 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3680833
@@ Property / cites work: Q3680833 / rank @@
+Normal rank
@@ Property / cites work @@
+Recent problems and results about kernels in directed graphs
+Normal rank
@@ Property / cites work @@
+Perfect graphs, kernels, and cores of cooperative games
+Normal rank
@@ Property / cites work @@
+Graphes Noyau-Parfaits
@@ Property / cites work: Graphes Noyau-Parfaits / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for a digraph to be kernel-perfect
+Normal rank
@@ Property / cites work @@
+A note on kernel-critical graphs
@@ Property / cites work: A note on kernel-critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete
+Normal rank
@@ Property / cites work @@
+Combinatorial games: Selected bibliography with a succinct gourmet introduction
+Normal rank
@@ Property / cites work @@
+A counterexample to a conjecture of Meyniel on kernel-perfect graphs
+Normal rank
@@ Property / cites work @@
+Semikernels modulo \(F\) and kernels in digraphs
@@ Property / cites work: Semikernels modulo \(F\) and kernels in digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some sufficient conditions for the existence of kernels in infinite digraphs
+Normal rank
@@ Property / cites work @@
+On kernels and semikernels of digraphs
@@ Property / cites work: On kernels and semikernels of digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On kernel-perfect critical digraphs
@@ Property / cites work: On kernel-perfect critical digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4774066
@@ Property / cites work: Q4774066 / rank @@
+Normal rank
@@ Property / cites work @@
+On weakly ordered systems
@@ Property / cites work: On weakly ordered systems / rank @@
+Normal rank
@@ Property / cites work @@
+On monochromatic paths in edge-coloured digraphs
@@ Property / cites work: On monochromatic paths in edge-coloured digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5844986
@@ Property / cites work: Q5844986 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2015.05.037
@@ Property / DOI: 10.1016/J.DAM.2015.05.037 / rank @@
+Normal rank