A note on quasi-kernels in digraphs

DOI10.1016/J.IPL.2015.06.017MaRDI QIDQ2353656zbMATH OpenOpenAlexFDO

Authors Cosmina Croitoru

Publication date 15 July 2015

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2015.06.017

zbMATH Keywords

kernelgraph algorithmsquasi-kerneltwo-way scanning of a digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• On the number of quasi-kernels in digraphs
• Quasi-Kernels for Oriented Paths and Cycles
• Sur les quasi-noyaux d'un graphe. (On quasi-kernels of a graph)
• Disjoint quasi-kernels in digraphs
• About quasi-kernels in a digraph

Cites work

• scientific article; zbMATH DE number 3465337 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• About quasi-kernels in a digraph
• Edmonds polytopes and a hierarchy of combinatorial problems
• On the number of quasi-kernels in digraphs
• Short proofs of classical theorems

Cited in

(11)

• Disjoint quasi-kernels in digraphs
• Quasi-kernels and quasi-sinks in infinite graphs
• About quasi-kernels in a digraph
• On the number of quasi-kernels in digraphs
• \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs
• scientific article; zbMATH DE number 5178709 (Why is no real title available?)
• Results on the small quasi-kernel conjecture
• Towards the small quasi-kernel conjecture
• Indepth combinatorial analysis of admissible sets for abstract argumentation
• Sur les quasi-noyaux d'un graphe. (On quasi-kernels of a graph)
• Quasi-Kernels for Oriented Paths and Cycles

This page was built for publication: A note on quasi-kernels in digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353656)