scientific article; zbMATH DE number 4095497

MaRDI QIDQ3822191zbMATH OpenFDO

Authors Pierre Duchet, C. Berge

Publication date 1988

zbMATH Keywords

kernel of a digraphperfect graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (05C99)

Recommendations

• Perfect graphs are kernel solvable
• On kernels in perfect graphs
• Kernels in perfect line-graphs
• Recent problems and results about kernels in directed graphs
• scientific article; zbMATH DE number 4095496

Cited in

(16)

• Parity graphs are kernel-M-solvable
• Perfect graphs are kernel solvable
• Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable
• Algorithms for interval catch digraphs
• Kernels in directed graphs: A poison game
• On clique covers and independence numbers of graphs
• Perfect graphs, kernels, and cores of cooperative games
• Recent problems and results about kernels in directed graphs
• Kernels by monochromatic paths and color-perfect digraphs
• scientific article; zbMATH DE number 4095496 (Why is no real title available?)
• Expressive power of digraph solvability
• On the orientation of meyniel graphs
• A new characterization of perfect graphs
• On kernels in perfect graphs
• Poison game for semikernels of arbitrary digraphs
• On the existence of independent \((1,k)\)-dominating sets for \(k\in\{1,2\}\) in two products of graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3822191)