\(k\)-colored kernels

DOI10.1016/j.dam.2012.04.019zbMath1246.05055arXiv1201.2712OpenAlexW1762890128MaRDI QIDQ442210

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

Publication date: 10 August 2012

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

Full work available at URL: https://arxiv.org/abs/1201.2712

zbMATH Keywords

\(k\)-colored absorbent set\(k\)-colored independent set\(k\)-colored kernel\(m\)-colored digraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Kernels by rainbow paths in arc-colored tournaments ⋮ Semicomplete Multipartite Digraphs ⋮ Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs

Cites Work

• On the structure of strong 3-quasi-transitive digraphs
• On monochromatic paths in m-coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• Kernels in edge-colored digraphs
• A counterexample to a conjecture on edge-coloured tournaments
• The structure of strong arc-locally semicomplete digraphs
• On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments
• Perfect graphs, kernels, and cores of cooperative games
• Monochromatic cycles and monochromatic paths in arc-colored digraphs
• Graphes Noyau-Parfaits
• Quasi‐transitive digraphs
• Digraphs

This page was built for publication: \(k\)-colored kernels