A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\)
From MaRDI portal
Publication:270266
DOI10.1007/s10114-012-9754-6zbMath1334.05049MaRDI QIDQ270266
Hortensia Galeana-Sánchez, Mucuy-kak Guevara, Camino Balbuena
Publication date: 7 April 2016
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-012-9754-6
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C20: Directed graphs (digraphs), tournaments
Related Items
Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs, Domination in Digraphs
Cites Work
- On kernels and semikernels of digraphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Domination number in graphs with minimum degree two
- On kernel-perfect critical digraphs
- A combinatorial problem in logic
- A combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs
- Semikernels modulo \(F\) and kernels in digraphs
- Solutions of irreflexive relations
- Graphes Noyau-Parfaits
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item