Kernels and some operations in edge-coloured digraphs

DOI10.1016/j.disc.2007.11.022zbMath1160.05025OpenAlexW1985224706MaRDI QIDQ998342

Hortensia Galeana-Sánchez, Rocío Rojas-Monroy

Publication date: 28 January 2009

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

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

zbMATH Keywords

kernelkernel by monochromatic paths\(m\)-coloured digraphedge coloured digraph

Mathematics Subject Classification ID

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

Related Items (3)

H-kernels by walks in an \(R_H (D)\) digraph ⋮ A new generalization of kernels in digraphs ⋮ $H$-kernels by walks in subdivision digraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On kernels and semikernels of digraphs
• On kernel-perfect critical digraphs
• On monochromatic paths in m-coloured tournaments
• A new method to extend kernel-perfect graphs to kernel-perfect critical graphs
• A note on kernel-critical graphs
• On monochromatic paths in edge-coloured digraphs
• Extending kernel perfect digraphs to kernel perfect critical digraphs
• Some operations preserving the existence of kernels
• Kernels in edge-colored digraphs
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• Solutions of irreflexive relations
• A sufficient condition for a digraph to be kernel-perfect
• Graphes Noyau-Parfaits
• Kernels in edge coloured line digraph
• Extension Theorems for Solutions of Irreflexive Relations

This page was built for publication: Kernels and some operations in edge-coloured digraphs