Richardson's theorem for k-colored kernels in strongly connected digraphs

DOI10.1016/J.DAM.2015.09.010zbMATH Open1332.05062OpenAlexW2195501938MaRDI QIDQ260020FDOQ260020

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

Publication date: 18 March 2016

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

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

zbMATH Keywords

kernelarc-coloringcolored-kernel

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On monochromatic paths in edge-coloured digraphs
• Perfect graphs, kernels, and cores of cooperative games
• On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
• Solutions of irreflexive relations
• On 2-dominating kernels in graphs
• Richardson's theorem in \(H\)-coloured digraphs
• Kernels by monochromatic paths and the color-class digraph
• \(k\)-colored kernels

Cited In (2)

• An extension of Richardson's theorem in m-colored digraphs
• Kernels by rainbow paths in arc-colored tournaments

This page was built for publication: Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs

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