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