-kernels in digraphs

DOI10.1007/S00373-014-1499-9zbMATH Open1327.05135OpenAlexW1987146070MaRDI QIDQ897229FDOQ897229

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

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

zbMATH Keywords

kerneldigraphkernel by monochromatic paths

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Title not available (Why is that?)
• On monochromatic paths in edge-coloured digraphs
• Perfect graphs, kernels, and cores of cooperative games
• Title not available (Why is that?)
• Title not available (Why is that?)
• On monochromatic paths in m-coloured tournaments
• Kernels in edge-colored digraphs
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• Title not available (Why is that?)
• Absorbing sets in arc-coloured tournaments
• Monochromatic cycles and monochromatic paths in arc-colored digraphs

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)