On kernel-perfect critical digraphs
From MaRDI portal
Publication:1076036
DOI10.1016/0012-365X(86)90172-XzbMath0593.05034MaRDI QIDQ1076036
Hortensia Galeana-Sánchez, Víctor Neumann-Lara
Publication date: 1986
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Unnamed Item, On a class of kernel-perfect and kernel-perfect-critical graphs, Orientations of graphs in kernel theory, Kernels and some operations in edge-coloured digraphs, A new method to extend kernel-perfect graphs to kernel-perfect critical graphs, A counterexample to a conjecture of Meyniel on kernel-perfect graphs, Extending kernel perfect digraphs to kernel perfect critical digraphs, On the existence of kernels and \(h\)-kernels in directed graphs, Normal fraternally orientable graphs satisfy the strong perfect graph conjecture, New extensions of kernel perfect digraphs to kernel imperfect critical digraphs, A circular graph---counterexample to the Duchet kernel conjecture, A combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs, Independent sets which meet all longest paths, On monochromatic paths and monochromatic cycles in edge coloured tournaments, Independent sets and non-augmentable paths in generalizations of tournaments, Perfect graphs, kernels, and cores of cooperative games, Kernels and perfectness in arc-local tournament digraphs
Cites Work
- On kernels and semikernels of digraphs
- A note on kernel-critical graphs
- A counterexample to a conjecture of Meyniel on kernel-perfect graphs
- Extending kernel perfect digraphs to kernel perfect critical digraphs
- The dichromatic number of a digraph
- Solutions of irreflexive relations
- Graphes Noyau-Parfaits
- Extension Theorems for Solutions of Irreflexive Relations
- On weakly ordered systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
