A Richardson's theorem version for \(\Pi\)-kernels

DOI10.1016/J.DISC.2017.01.008zbMath1357.05051OpenAlexW2587092165MaRDI QIDQ512571

Juan José Montellano-Ballesteros, Hortensia Galeana-Sánchez

Publication date: 27 February 2017

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

Full work available at URL: https://doi.org/10.1016/j.disc.2017.01.008

zbMATH Keywords

Richardson's theorem\(\Pi\)-kernel

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

H-kernels by walks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\Pi\)-kernels in digraphs
• A note on kernel-critical graphs
• On monochromatic paths in edge-coloured digraphs
• Perfect graphs, kernels, and cores of cooperative games
• Solutions of irreflexive relations

This page was built for publication: A Richardson's theorem version for \(\Pi\)-kernels