Pages that link to "Item:Q2651359"
From MaRDI portal
The following pages link to Solutions of irreflexive relations (Q2651359):
Displaying 50 items.
- Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs (Q260020) (← links)
- 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)
- Computing kernels in directed bichromatic graphs (Q287022) (← links)
- Richardson's theorem in \(H\)-coloured digraphs (Q292262) (← links)
- Coloring, sparseness and girth (Q312271) (← 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)
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- On the solution of \(w\)-stable sets (Q502372) (← links)
- A Richardson's theorem version for \(\Pi\)-kernels (Q512571) (← links)
- A new generalization of kernels in digraphs (Q516902) (← links)
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676) (← links)
- A Ramsey bound on stable sets in Jordan pillage games (Q637574) (← links)
- On kernels and semikernels of digraphs (Q787155) (← links)
- Orientations of graphs in kernel theory (Q809100) (← links)
- \(\Gamma\)-cycles in arc-colored digraphs (Q907835) (← links)
- RUBIS: a bipolar-valued outranking method for the choice problem (Q941003) (← links)
- Kernels and partial line digraphs (Q990794) (← links)
- Kernels and some operations in edge-coloured digraphs (Q998342) (← links)
- Strategic basins of attraction, the path dominance core, and network formation games (Q1021609) (← links)
- Vertex- and edge-minimal and locally minimal graphs (Q1043552) (← links)
- On kernel-perfect critical digraphs (Q1076036) (← links)
- A parity digraph has a kernel (Q1080430) (← links)
- Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes (Q1172646) (← links)
- Extending kernel perfect digraphs to kernel perfect critical digraphs (Q1182966) (← links)
- Covering the vertex set of a graph with subgraphs of smaller degree (Q1243281) (← links)
- On directed graphs with an independent covering set (Q1264153) (← links)
- On fuzzification of some concepts of graphs (Q1302238) (← links)
- Enumerating the kernels of a directed graph with no odd circuits (Q1332748) (← links)
- A corrected version of the Duchet kernel conjecture (Q1377724) (← links)
- A circular graph---counterexample to the Duchet kernel conjecture (Q1377838) (← links)
- Kernels in pretransitive digraphs. (Q1420591) (← links)
- Alternative foundations for Reiter's default logic (Q1589575) (← links)
- Kernels of digraphs with finitely many ends (Q1625806) (← 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)
- On kernels in i-triangulated graphs (Q1821791) (← links)
- From kernels in directed graphs to fixed points and negative cycles in Boolean networks (Q1949117) (← links)
- Critical kernel imperfect problem in generalizations of bipartite tournaments (Q2000560) (← links)
- Strategic information transmission with sender's approval (Q2041079) (← links)
- Kernels by rainbow paths in arc-colored tournaments (Q2185722) (← links)
- Richardson's theorem in quasi-transitive and pre-transitive digraphs (Q2191277) (← links)
- The solution of generalized stable sets and its refinement (Q2243513) (← links)
- An extension of Richardson's theorem in m-colored digraphs (Q2354614) (← links)
- Infinite kernel perfect digraphs (Q2409759) (← links)
- A note on orientation and chromatic number of graphs (Q2410109) (← links)
