A new generalization of kernels in digraphs
From MaRDI portal
Publication:516902
DOI10.1016/J.DAM.2016.09.048zbMATH Open1358.05127OpenAlexW2537222117MaRDI QIDQ516902FDOQ516902
Authors: Amina Ramoul, Mostafa Blidia 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
- On monochromatic paths in edge-coloured digraphs
- Some bounds on the \(p\)-domination number in trees
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
- Solutions of irreflexive relations
- Title not available (Why is that?)
- \(k\)-domination and \(k\)-independence in graphs: A survey
- On monochromatic paths in m-coloured tournaments
- Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete
- Kernels in edge-colored digraphs
- A counterexample to a conjecture on edge-coloured tournaments
- Recent problems and results about kernels in directed graphs
- A sufficient condition for a digraph to be kernel-perfect
- Graphes Noyau-Parfaits
- Extension Theorems for Solutions of Irreflexive Relations
- On kernels and semikernels of digraphs
- Title not available (Why is that?)
- A note on kernel-critical graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs
- \(k\)-kernels in generalizations of transitive digraphs
- Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes
- A parity digraph has a kernel
- On the complexity of the 3-kernel problem in some classes of digraphs
- A note on Duchet's conjecture
- Title not available (Why is that?)
- Kernels and some operations in edge-coloured digraphs
Cited In (14)
- On (k,l)-perfectnees of Special Classes of Digraphs
- Title not available (Why is that?)
- A note on the kernel number
- Title not available (Why is that?)
- About quasi-kernels in a digraph
- On the kernel and related problems in interval digraphs
- Kernels in graphs with a clique-cutset
- Classes of intersection digraphs with good algorithmic properties
- On 2-dominating kernels in graphs
- Domination in Digraphs
- Kernels in weighted digraphs
- On the \(k\)-domination number of digraphs
- A dichotomy for the kernel by H‐walks problem in digraphs
- On the existence of (k,\(\ell)\)-kernels in digraphs
This page was built for publication: A new generalization of kernels in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516902)
