A new generalization of kernels in digraphs
From MaRDI portal
Publication:516902
DOI10.1016/j.dam.2016.09.048zbMath1358.05127OpenAlexW2537222117MaRDI QIDQ516902
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.048
Related Items (3)
Classes of intersection digraphs with good algorithmic properties ⋮ Domination in Digraphs ⋮ On the \(k\)-domination number of digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(k\)-domination and \(k\)-independence in graphs: A survey
- On kernels and semikernels of digraphs
- On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs
- Kernels and some operations in edge-coloured digraphs
- A note on Duchet's conjecture
- On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
- A parity digraph has a kernel
- On monochromatic paths in m-coloured tournaments
- A note on kernel-critical graphs
- On monochromatic paths in edge-coloured digraphs
- Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete
- Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes
- Kernels in edge-colored digraphs
- A counterexample to a conjecture on edge-coloured tournaments
- On the complexity of the 3-kernel problem in some classes of digraphs
- Some bounds on the \(p\)-domination number in trees
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
- Recent problems and results about kernels in directed graphs
- Solutions of irreflexive relations
- k-kernels in generalizations of transitive digraphs
- A sufficient condition for a digraph to be kernel-perfect
- Graphes Noyau-Parfaits
- Extension Theorems for Solutions of Irreflexive Relations
This page was built for publication: A new generalization of kernels in digraphs
