scientific article; zbMATH DE number 4095497
From MaRDI portal
Publication:3822191
Recommendations
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
- scientific article; zbMATH DE number 4095496 (Why is no real title available?)
- 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)