A new generalization of kernels in digraphs

DOI10.1016/J.DAM.2016.09.048MaRDI QIDQ516902zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

kerneldigraphskernel-perfect digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• On the existence of (k,\(\ell)\)-kernels in digraphs
• Semikernels and (k,l)-Kernels in Digraphs
• (k,l)-kernels in line digraphs
• On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
• k-Kernels and some operations in digraphs

Cites work

• scientific article; zbMATH DE number 3902654 (Why is no real title available?)
• scientific article; zbMATH DE number 3914370 (Why is no real title available?)
• scientific article; zbMATH DE number 3914371 (Why is no real title available?)
• scientific article; zbMATH DE number 3803484 (Why is no real title available?)
• scientific article; zbMATH DE number 3405983 (Why is no real title available?)
• scientific article; zbMATH DE number 3084669 (Why is no real title available?)
• A counterexample to a conjecture on edge-coloured tournaments
• A note on Duchet's conjecture
• A note on kernel-critical graphs
• A parity digraph has a kernel
• A sufficient condition for a digraph to be kernel-perfect
• Extension Theorems for Solutions of Irreflexive Relations
• Graphes Noyau-Parfaits
• Kernels and some operations in edge-coloured digraphs
• Kernels in edge-colored digraphs
• On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
• On kernels and semikernels of digraphs
• On monochromatic paths in edge-coloured digraphs
• On monochromatic paths in m-coloured tournaments
• On the complexity of the 3-kernel problem in some classes of digraphs
• On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs
• On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
• Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete
• Recent problems and results about kernels in directed graphs
• Solutions of irreflexive relations
• Some bounds on the \(p\)-domination number in trees
• Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes
• \(k\)-domination and \(k\)-independence in graphs: A survey
• \(k\)-kernels in generalizations of transitive digraphs

Cited in

(14)

• Kernels in graphs with a clique-cutset
• scientific article; zbMATH DE number 6784970 (Why is no real title available?)
• On the \(k\)-domination number of digraphs
• About quasi-kernels in a digraph
• scientific article; zbMATH DE number 6857816 (Why is no real title available?)
• Classes of intersection digraphs with good algorithmic properties
• On 2-dominating kernels in graphs
• A dichotomy for the kernel by H‐walks problem in digraphs
• On the existence of (k,\(\ell)\)-kernels in digraphs
• Kernels in weighted digraphs
• Domination in digraphs
• On (k,l)-perfectnees of Special Classes of Digraphs
• A note on the kernel number
• On the kernel and related problems in interval 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)