An extension of Richardson's theorem in m-colored digraphs

DOI10.1007/s00373-014-1412-6zbMath1317.05071OpenAlexW2054414965MaRDI QIDQ2354614

Rocío Sánchez-López, Hortensia Galeana-Sánchez

Publication date: 20 July 2015

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

Full work available at URL: https://doi.org/10.1007/s00373-014-1412-6

zbMATH Keywords

kernelcolor-class digraphkernel by monochromatic paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

\(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On monochromatic paths in m-coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete
• Kernels in edge-colored digraphs
• Absorbing sets in arc-coloured tournaments
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• Perfect graphs, kernels, and cores of cooperative games
• Recent problems and results about kernels in directed graphs
• Solutions of irreflexive relations
• Kernels by monochromatic paths and the color-class digraph
• Graphes Noyau-Parfaits

This page was built for publication: An extension of Richardson's theorem in m-colored digraphs