On kernels and semikernels of digraphs
From MaRDI portal
Cites work
- A counterexample to a conjecture of Meyniel on kernel-perfect graphs
- A note on kernel-critical graphs
- Extension Theorems for Solutions of Irreflexive Relations
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3509340 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- On weakly ordered systems
- Solutions of irreflexive relations
Cited in
(53)- Some sufficient conditions for the existence of kernels in infinite digraphs
- On kernel-perfect critical digraphs
- A theorem about a conjecture of H. Meyniel on kernel-perfect graphs
- Parity graphs are kernel-M-solvable
- Extending kernel perfect digraphs to kernel perfect critical digraphs
- On directed graphs with an independent covering set
- Algorithms for interval catch digraphs
- Enumerating the kernels of a directed graph with no odd circuits
- Kernels in pretransitive digraphs.
- Alternating kernels
- Kernels by properly colored paths in arc-colored digraphs
- Fixed points and connections between positive and negative cycles in Boolean networks
- Kernels in directed graphs: A poison game
- On kernels in i-triangulated graphs
- \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory
- Combinatorial games on a graph
- Independent sets which meet all longest paths
- From kernels in directed graphs to fixed points and negative cycles in Boolean networks
- Kernels by rainbow paths in arc-colored tournaments
- Kernels in random graphs
- Unions of digraphs which become kernel perfect
- Perfect graphs, kernels, and cores of cooperative games
- Kernels and perfectness in arc-local tournament digraphs
- Kernels in quasi-transitive digraphs
- Recent problems and results about kernels in directed graphs
- 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
- Cycles and transitivity by monochromatic paths in arc-coloured digraphs
- Domination in digraphs
- Kernel perfect and critical kernel imperfect digraphs structure
- Expressive power of digraph solvability
- Finding kernels or solving SAT
- Kernels in digraphs that are not kernel perfect
- Propositional discourse logic
- Enumeration of preferred extensions in almost oriented digraphs
- A new generalization of kernels in digraphs
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- \((H, k)\)-reachability in \(H\)-arc-colored digraphs
- Lattice point of view for argumentation framework
- On the kernel and related problems in interval digraphs
- On \(\mathcal{F} \)-systems: a graph-theoretic model for paradoxes involving a falsity predicate and its application to argumentation frameworks
- Weak argumentation semantics and unsafe odd cycles: results and a conjecture
- Graph theoretical structures in logic programs and default theories
- More on discrete convexity
- On kernels in perfect graphs
- Poison game for semikernels of arbitrary digraphs
- Local stability in kidney exchange programs
- The theorem of Richardson and its generalizations: a survey
- Orientations of graphs in kernel theory
- Bibliography on domination in graphs and some basic definitions of domination parameters
- \(\Gamma\)-cycles in arc-colored digraphs
- Kernels and some operations in edge-coloured 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)
