Graphes Noyau-Parfaits
From MaRDI portal
Publication:3912817
DOI10.1016/S0167-5060(08)70041-4zbMath0462.05033OpenAlexW198124755MaRDI QIDQ3912817
Publication date: 1980
Published in: Combinatorics 79 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70041-4
Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)
Related Items (56)
On kernel-perfect critical digraphs ⋮ A combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs ⋮ A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) ⋮ A parity digraph has a kernel ⋮ Kernels by monochromatic paths and color-perfect digraphs ⋮ On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments ⋮ A theorem about a conjecture of H. Meyniel on kernel-perfect graphs ⋮ Enumerating the kernels of a directed graph with no odd circuits ⋮ Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs ⋮ H-kernels by walks ⋮ Cycles and transitivity by monochromatic paths in arc-coloured digraphs ⋮ Recent problems and results about kernels in directed graphs ⋮ A sufficient condition for a digraph to be kernel-perfect ⋮ A corrected version of the Duchet kernel conjecture ⋮ A circular graph---counterexample to the Duchet kernel conjecture ⋮ Parity graphs are kernel-M-solvable ⋮ Infinite kernel perfect digraphs ⋮ On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints ⋮ Kernels by rainbow paths in arc-colored tournaments ⋮ \((H, k)\)-reachability in \(H\)-arc-colored digraphs ⋮ Unions of digraphs which become kernel perfect ⋮ On the existence of 3- and 4-kernels in digraphs ⋮ Richardson's theorem in quasi-transitive and pre-transitive digraphs ⋮ Expressive power of digraph solvability ⋮ Finding kernels or solving SAT ⋮ A note on kernel-critical graphs ⋮ \(\Gamma\)-cycles in arc-colored digraphs ⋮ Perfect graphs, kernels, and cores of cooperative games ⋮ \(k\)-colored kernels ⋮ A counterexample to a conjecture of Meyniel on kernel-perfect graphs ⋮ Kernels in pretransitive digraphs. ⋮ Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes ⋮ Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs) ⋮ Propositional discourse logic ⋮ Extending kernel perfect digraphs to kernel perfect critical digraphs ⋮ Kernels by properly colored paths in arc-colored digraphs ⋮ A new generalization of kernels in digraphs ⋮ On kernels in perfect graphs ⋮ On a class of kernel-perfect and kernel-perfect-critical graphs ⋮ Discrete representation of the non-dominated set for multi-objective optimization problems using kernels ⋮ On the existence of kernels and \(h\)-kernels in directed graphs ⋮ Kernels in quasi-transitive digraphs ⋮ Kernels in random graphs ⋮ On the existence of \((k,l)\)-kernels in infinite digraphs: a survey ⋮ Kernels and some operations in edge-coloured digraphs ⋮ Kernels in directed graphs: A poison game ⋮ Domination in Digraphs ⋮ On directed graphs with an independent covering set ⋮ On kernels by rainbow paths in arc-coloured digraphs ⋮ Some sufficient conditions for the existence of kernels in infinite digraphs ⋮ Kernels in some orientations of comparability graphs ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Vertex- and edge-minimal and locally minimal graphs ⋮ On the existence of (k,\(\ell)\)-kernels in digraphs ⋮ Orientations of graphs in kernel theory ⋮ An extension of Richardson's theorem in m-colored digraphs
This page was built for publication: Graphes Noyau-Parfaits
