Enumerating the kernels of a directed graph with no odd circuits

DOI10.1016/0020-0190(94)00072-7zbMath0821.68068OpenAlexW2093106936MaRDI QIDQ1332748

Jayme Luiz Szwarcfiter, Guy Chaty

Publication date: 19 September 1995

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00072-7

zbMATH Keywords

computational complexitydirected graphkernels

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Unnamed Item ⋮ On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• On kernels and semikernels of digraphs
• A note on kernel-critical graphs
• A counterexample to a conjecture of Meyniel on kernel-perfect graphs
• Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes
• Recent problems and results about kernels in directed graphs
• Solutions of irreflexive relations
• A backtracking algorithm to generate all kernels of a directed graph
• Graphes Noyau-Parfaits
• A remark on a problem of Harary

This page was built for publication: Enumerating the kernels of a directed graph with no odd circuits