On kernel-perfect critical digraphs
From MaRDI portal
Publication:1076036
DOI10.1016/0012-365X(86)90172-XzbMath0593.05034MaRDI QIDQ1076036
Víctor Neumann-Lara, Hortensia Galeana-Sánchez
Publication date: 1986
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
A combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs, A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\), Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs, New extensions of kernel perfect digraphs to kernel imperfect critical digraphs, Cycles and transitivity by monochromatic paths in arc-coloured digraphs, Unnamed Item, A characterization of locally semicomplete CKI-digraphs, Independent sets which meet all longest paths, A circular graph---counterexample to the Duchet kernel conjecture, A new method to extend kernel-perfect graphs to kernel-perfect critical graphs, On monochromatic paths and monochromatic cycles in edge coloured tournaments, Infinite kernel perfect digraphs, Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3, Unions of digraphs which become kernel perfect, Alternating kernels, Independent sets and non-augmentable paths in generalizations of tournaments, \(\Gamma\)-cycles in arc-colored digraphs, Perfect graphs, kernels, and cores of cooperative games, Kernels and perfectness in arc-local tournament digraphs, A new characterization of perfect graphs, A counterexample to a conjecture of Meyniel on kernel-perfect graphs, Extending kernel perfect digraphs to kernel perfect critical digraphs, On a class of kernel-perfect and kernel-perfect-critical graphs, Critical kernel imperfect problem in generalizations of bipartite tournaments, On the existence of kernels and \(h\)-kernels in directed graphs, Kernels and some operations in edge-coloured digraphs, CKI-digraphs, generalized sums and partitions of digraphs, Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks, \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs, Normal fraternally orientable graphs satisfy the strong perfect graph conjecture, Orientations of graphs in kernel theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
