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

DOI10.1016/j.disc.2015.05.021zbMath1318.05027OpenAlexW615800166MaRDI QIDQ2515566

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

Publication date: 5 August 2015

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

Full work available at URL: https://doi.org/10.1016/j.disc.2015.05.021

zbMATH Keywords

kernelkernel by monochromatic pathskernel perfect digraph\(H\)-kernelobstruction number

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

A generalization of properly colored paths and cycles in edge-colored graphs ⋮ Restricted domination in quasi-transitive and 3-quasi-transitive digraphs ⋮ Fixed points and connections between positive and negative cycles in Boolean networks ⋮ Some conditions for the existence of Euler \(H\)-trails

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Richardson's theorem in \(H\)-coloured digraphs
• \(H\)-kernels in infinite digraphs
• On monochromatic paths in edge-coloured digraphs
• Kernels in pretransitive digraphs.
• Kernels in edge-colored digraphs
• An extension of Richardson's theorem in m-colored digraphs
• Perfect graphs, kernels, and cores of cooperative games
• Restricted domination in arc-colored digraphs
• Reachability problems in edge-colored digraphs
• Solutions of irreflexive relations
• Kernels by monochromatic paths and the color-class digraph

This page was built for publication: \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs