scientific article; zbMATH DE number 4095497

zbMATH Open0669.05037MaRDI QIDQ3822191FDOQ3822191

Authors: Pierre Duchet, C. Berge 

Publication date: 1988

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

perfect graphskernel of a digraph

Mathematics Subject Classification ID

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

Cited In (13)

• On kernels in perfect graphs
• A new characterization of perfect graphs
• Expressive power of digraph solvability
• Kernels by monochromatic paths and color-perfect digraphs
• Parity graphs are kernel-M-solvable
• Algorithms for interval catch digraphs
• Kernels in directed graphs: A poison game
• Perfect graphs, kernels, and cores of cooperative games
• On clique covers and independence numbers of graphs
• Recent problems and results about kernels in directed graphs
• Title not available (Why is that?)
• Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable
• On the orientation of meyniel 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)