A theorem about a conjecture of H. Meyniel on kernel-perfect graphs

DOI10.1016/0012-365X(86)90066-XzbMath0602.05032OpenAlexW2083045902WikidataQ123356369 ScholiaQ123356369MaRDI QIDQ1081612

Hortensia Galeana-Sánchez

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(86)90066-x

zbMATH Keywords

cycleskernel-perfect graphR-digraph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

\(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory ⋮ Perfect graphs, kernels, and cores of cooperative games ⋮ A counterexample to a conjecture of Meyniel on kernel-perfect graphs ⋮ Orientations of graphs in kernel theory ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• On kernels and semikernels of digraphs
• Graphes Noyau-Parfaits

This page was built for publication: A theorem about a conjecture of H. Meyniel on kernel-perfect graphs