Pages that link to "Item:Q1172646"
From MaRDI portal
The following pages link to Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes (Q1172646):
Displaying 18 items.
- Expressive power of digraph solvability (Q409316) (← links)
- Finding kernels or solving SAT (Q414435) (← links)
- Propositional discourse logic (Q484942) (← links)
- A new generalization of kernels in digraphs (Q516902) (← links)
- Orientations of graphs in kernel theory (Q809100) (← links)
- On directed graphs with an independent covering set (Q1264153) (← links)
- Normal fraternally orientable graphs satisfy the strong perfect graph conjecture (Q1313857) (← links)
- Enumerating the kernels of a directed graph with no odd circuits (Q1332748) (← links)
- Kernels by properly colored paths in arc-colored digraphs (Q1744736) (← 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)
- Kernels by rainbow paths in arc-colored tournaments (Q2185722) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
- Recent problems and results about kernels in directed graphs (Q2640613) (← links)
- On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints (Q3216679) (← links)
- Kernel perfect and critical kernel imperfect digraphs structure (Q3439612) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
