On kernels and semikernels of digraphs
From MaRDI portal
Publication:787155
DOI10.1016/0012-365X(84)90131-6zbMath0529.05024MaRDI QIDQ787155
Víctor Neumann-Lara, Hortensia Galeana-Sánchez
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (48)
On kernel-perfect critical digraphs ⋮ A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) ⋮ Algorithms for interval catch digraphs ⋮ Kernels by monochromatic paths and color-perfect digraphs ⋮ A theorem about a conjecture of H. Meyniel on kernel-perfect graphs ⋮ Enumerating the kernels of a directed graph with no odd circuits ⋮ Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs ⋮ \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory ⋮ Cycles and transitivity by monochromatic paths in arc-coloured digraphs ⋮ Recent problems and results about kernels in directed graphs ⋮ Combinatorial games on a graph ⋮ Independent sets which meet all longest paths ⋮ Parity graphs are kernel-M-solvable ⋮ Kernels by rainbow paths in arc-colored tournaments ⋮ \((H, k)\)-reachability in \(H\)-arc-colored digraphs ⋮ Lattice point of view for argumentation framework ⋮ Unions of digraphs which become kernel perfect ⋮ Expressive power of digraph solvability ⋮ On the kernel and related problems in interval digraphs ⋮ Alternating kernels ⋮ Finding kernels or solving SAT ⋮ On \(\mathcal{F} \)-systems: a graph-theoretic model for paradoxes involving a falsity predicate and its application to argumentation frameworks ⋮ \(\Gamma\)-cycles in arc-colored digraphs ⋮ Perfect graphs, kernels, and cores of cooperative games ⋮ Kernels and perfectness in arc-local tournament digraphs ⋮ From kernels in directed graphs to fixed points and negative cycles in Boolean networks ⋮ Kernels in digraphs that are not kernel perfect ⋮ Kernels in pretransitive digraphs. ⋮ Propositional discourse logic ⋮ Extending kernel perfect digraphs to kernel perfect critical digraphs ⋮ Graph theoretical structures in logic programs and default theories ⋮ Kernels by properly colored paths in arc-colored digraphs ⋮ A new generalization of kernels in digraphs ⋮ On kernels in perfect graphs ⋮ Fixed points and connections between positive and negative cycles in Boolean networks ⋮ Kernels in quasi-transitive digraphs ⋮ Kernels in random graphs ⋮ Unnamed Item ⋮ Kernels and some operations in edge-coloured digraphs ⋮ Kernels in directed graphs: A poison game ⋮ Domination in Digraphs ⋮ On directed graphs with an independent covering set ⋮ Some sufficient conditions for the existence of kernels in infinite digraphs ⋮ On kernels in i-triangulated graphs ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Kernel perfect and critical kernel imperfect digraphs structure ⋮ Orientations of graphs in kernel theory ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
Cites Work
This page was built for publication: On kernels and semikernels of digraphs
