Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes
From MaRDI portal
Publication:1172646
DOI10.1016/0012-365X(83)90017-1zbMath0502.05027OpenAlexW2041481105MaRDI QIDQ1172646
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(83)90017-1
Related Items (18)
Enumerating the kernels of a directed graph with no odd circuits ⋮ \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory ⋮ Recent problems and results about kernels in directed graphs ⋮ Combinatorial games on a graph ⋮ Independent sets which meet all longest paths ⋮ On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints ⋮ Kernels by rainbow paths in arc-colored tournaments ⋮ Expressive power of digraph solvability ⋮ Finding kernels or solving SAT ⋮ Perfect graphs, kernels, and cores of cooperative games ⋮ Propositional discourse logic ⋮ Kernels by properly colored paths in arc-colored digraphs ⋮ A new generalization of kernels in digraphs ⋮ On directed graphs with an independent covering set ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Normal fraternally orientable graphs satisfy the strong perfect graph conjecture ⋮ Kernel perfect and critical kernel imperfect digraphs structure ⋮ Orientations of graphs in kernel theory
Cites Work
This page was built for publication: Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes
