Pages that link to "Item:Q787155"
From MaRDI portal
The following pages link to On kernels and semikernels of digraphs (Q787155):
Displaying 48 items.
- A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) (Q270266) (← links)
- Kernels by monochromatic paths and color-perfect digraphs (Q274681) (← links)
- Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs (Q299098) (← links)
- Cycles and transitivity by monochromatic paths in arc-coloured digraphs (Q321986) (← links)
- Expressive power of digraph solvability (Q409316) (← links)
- Finding kernels or solving SAT (Q414435) (← links)
- Kernels in digraphs that are not kernel perfect (Q442354) (← links)
- Propositional discourse logic (Q484942) (← links)
- A new generalization of kernels in digraphs (Q516902) (← links)
- Graph theoretical structures in logic programs and default theories (Q672050) (← links)
- On kernels in perfect graphs (Q684411) (← links)
- Orientations of graphs in kernel theory (Q809100) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- \(\Gamma\)-cycles in arc-colored digraphs (Q907835) (← links)
- Kernels and some operations in edge-coloured digraphs (Q998342) (← links)
- Some sufficient conditions for the existence of kernels in infinite digraphs (Q1025568) (← links)
- On kernel-perfect critical digraphs (Q1076036) (← links)
- A theorem about a conjecture of H. Meyniel on kernel-perfect graphs (Q1081612) (← links)
- Parity graphs are kernel-M-solvable (Q1121920) (← links)
- Extending kernel perfect digraphs to kernel perfect critical digraphs (Q1182966) (← links)
- On directed graphs with an independent covering set (Q1264153) (← links)
- Algorithms for interval catch digraphs (Q1329814) (← links)
- Enumerating the kernels of a directed graph with no odd circuits (Q1332748) (← links)
- Kernels in pretransitive digraphs. (Q1420591) (← links)
- Alternating kernels (Q1693142) (← links)
- Kernels by properly colored paths in arc-colored digraphs (Q1744736) (← links)
- Fixed points and connections between positive and negative cycles in Boolean networks (Q1752437) (← links)
- Kernels in directed graphs: A poison game (Q1801706) (← links)
- On kernels in i-triangulated graphs (Q1821791) (← links)
- \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory (Q1897444) (← links)
- Combinatorial games on a graph (Q1916376) (← links)
- Independent sets which meet all longest paths (Q1917489) (← links)
- From kernels in directed graphs to fixed points and negative cycles in Boolean networks (Q1949117) (← links)
- Kernels by rainbow paths in arc-colored tournaments (Q2185722) (← links)
- Kernels in random graphs (Q2277494) (← links)
- Unions of digraphs which become kernel perfect (Q2420420) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
- Kernels and perfectness in arc-local tournament digraphs (Q2433708) (← links)
- Kernels in quasi-transitive digraphs (Q2501570) (← links)
- Recent problems and results about kernels in directed graphs (Q2640613) (← links)
- Domination in Digraphs (Q3384119) (← links)
- Kernel perfect and critical kernel imperfect digraphs structure (Q3439612) (← links)
- (Q5092437) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- \((H, k)\)-reachability in \(H\)-arc-colored digraphs (Q6044470) (← links)
- Lattice point of view for argumentation framework (Q6059223) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)
- On \(\mathcal{F} \)-systems: a graph-theoretic model for paradoxes involving a falsity predicate and its application to argumentation frameworks (Q6169322) (← links)
