Unions of digraphs which become kernel perfect

DOI10.1016/j.dam.2018.06.033zbMath1414.05132OpenAlexW2885632464WikidataQ129414239 ScholiaQ129414239MaRDI QIDQ2420420

Hortensia Galeana-Sánchez, Mucuy-kak Guevara

Publication date: 6 June 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.06.033

zbMATH Keywords

digraphskerneldominationsemikernelkernel-perfect

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• On kernels and semikernels of digraphs
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Domination number in graphs with minimum degree two
• On kernel-perfect critical digraphs
• On monochromatic paths in edge-coloured digraphs
• A combinatorial problem in logic
• Kernels in pretransitive digraphs.
• Semikernels modulo \(F\) and kernels in digraphs
• Kernels in quasi-transitive digraphs
• Solutions of irreflexive relations
• Graphes Noyau-Parfaits
• Digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Unions of digraphs which become kernel perfect