A note on quasi-kernels in digraphs

DOI10.1016/J.IPL.2015.06.017zbMATH Open1332.05060OpenAlexW765555519MaRDI QIDQ2353656FDOQ2353656

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

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

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)

Cites Work

• Title not available (Why is that?)
• Edmonds polytopes and a hierarchy of combinatorial problems
• About quasi-kernels in a digraph
• Title not available (Why is that?)
• On the number of quasi-kernels in digraphs
• Short proofs of classical theorems

Cited In (10)

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

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)