-kernels in digraphs

DOI10.1007/S00373-014-1499-9MaRDI QIDQ897229zbMATH OpenOpenAlexFDO

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

Publication date 17 December 2015

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-014-1499-9

zbMATH Keywords

kerneldigraphkernel by monochromatic paths

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• A Richardson's theorem version for \(\Pi\)-kernels
• Kernels in infinite digraphs
• k-Kernels and some operations in digraphs
• On the existence of (k,\(\ell)\)-kernels in digraphs
• On the existence of 3- and 4-kernels in digraphs

Cites work

• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 1153462 (Why is no real title available?)
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• Absorbing sets in arc-coloured tournaments
• Kernels in edge-colored digraphs
• Monochromatic cycles and monochromatic paths in arc-colored digraphs
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• On monochromatic paths in m-coloured tournaments
• Perfect graphs, kernels, and cores of cooperative games

Cited in

(3)

• Extensions of Richardson's theorem for infinite digraphs and \((\mathscr{A} , \mathscr{B} )\)-kernels
• \((\mathscr{A}, \mathscr{B})\)-kernels and Sands, Sauer and Woodrow's theorem
• A Richardson's theorem version for \(\Pi\)-kernels

This page was built for publication: \(\Pi\)-kernels in digraphs

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