A Richardson's theorem version for -kernels

DOI10.1016/J.DISC.2017.01.008zbMATH Open1357.05051OpenAlexW2587092165MaRDI QIDQ512571FDOQ512571

Authors: 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

Recommendations

• \(\Pi\)-kernels in digraphs
• Richardson's theorem in \(H\)-coloured digraphs
• Extensions of Richardson's theorem for infinite digraphs and \((\mathscr{A} , \mathscr{B} )\)-kernels
• Richardson's theorem in quasi-transitive and pre-transitive digraphs
• Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On monochromatic paths in edge-coloured digraphs
• Perfect graphs, kernels, and cores of cooperative games
• Solutions of irreflexive relations
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on kernel-critical graphs
• \(\Pi\)-kernels in digraphs

Cited In (6)

• Extensions of Richardson's theorem for infinite digraphs and \((\mathscr{A} , \mathscr{B} )\)-kernels
• H-kernels by walks
• Richardson's theorem in quasi-transitive and pre-transitive digraphs
• Kernels of digraphs with finitely many ends
• \(\Pi\)-kernels in digraphs
• Nikol'skii theorem for kernels satisfying the more general condition than \(A_n^*\)

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

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