A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) (Q270266): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10114-012-9754-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2124146024
@@ Property / OpenAlex ID: W2124146024 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4350166
@@ Property / cites work: Q4350166 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4378637
@@ Property / cites work: Q4378637 / rank @@
+Normal rank
@@ Property / cites work @@
+Bibliography on domination in graphs and some basic definitions of domination parameters
+Normal rank
@@ Property / cites work @@
+Domination number in graphs with minimum degree two
+Normal rank
@@ Property / cites work @@
+A combinatorial problem in logic
@@ Property / cites work: A combinatorial problem in logic / rank @@
+Normal rank
@@ Property / cites work @@
+Q5799732
@@ Property / cites work: Q5799732 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5844986
@@ Property / cites work: Q5844986 / rank @@
+Normal rank
@@ Property / cites work @@
+Solutions of irreflexive relations
@@ Property / cites work: Solutions of irreflexive relations / rank @@
+Normal rank
@@ Property / cites work @@
+Graphes Noyau-Parfaits
@@ Property / cites work: Graphes Noyau-Parfaits / rank @@
+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 @@
+Semikernels modulo \(F\) and kernels in digraphs
@@ Property / cites work: Semikernels modulo \(F\) and kernels in digraphs / rank @@
+Normal rank