The following pages link to Perfect graphs and kernels (Q3822191):
Displaying 14 items.
- Kernels by monochromatic paths and color-perfect digraphs (Q274681) (← links)
- Expressive power of digraph solvability (Q409316) (← links)
- A new characterization of perfect graphs (Q442410) (← links)
- On kernels in perfect graphs (Q684411) (← links)
- Parity graphs are kernel-M-solvable (Q1121920) (← links)
- Perfect graphs are kernel solvable (Q1126176) (← links)
- Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable (Q1196561) (← links)
- Algorithms for interval catch digraphs (Q1329814) (← links)
- Kernels in directed graphs: A poison game (Q1801706) (← links)
- On clique covers and independence numbers of graphs (Q1839263) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
- Recent problems and results about kernels in directed graphs (Q2640613) (← links)
- Recent problems and results about kernels in directed graphs (Q3822190) (← links)
- On the orientation of meyniel graphs (Q4312247) (← links)