A counterexample to a conjecture of Meyniel on kernel-perfect graphs
From MaRDI portal
Publication:1163568
DOI10.1016/0012-365X(82)90087-5zbMath0484.05035WikidataQ123273592 ScholiaQ123273592MaRDI QIDQ1163568
Publication date: 1982
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
On kernel-perfect critical digraphs, A parity digraph has a kernel, Enumerating the kernels of a directed graph with no odd circuits, Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs, \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory, Recent problems and results about kernels in directed graphs, On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints, Perfect graphs, kernels, and cores of cooperative games, Extending kernel perfect digraphs to kernel perfect critical digraphs, Negative local feedbacks in Boolean networks, Domination in Digraphs, On kernels and semikernels of digraphs, On kernel-perfect orientations of line graphs, Orientations of graphs in kernel theory
Cites Work
