Kernels and some operations in edge-coloured digraphs

DOI10.1016/J.DISC.2007.11.022MaRDI QIDQ998342zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Kernels in edge-colored digraphs
• Cycles and transitivity by monochromatic paths in arc-coloured digraphs
• Kernels in edge coloured line digraph
• Kernels in edge-coloured orientations of nearly complete graphs
• Kernels by monochromatic directed paths in \(m\)-colored digraphs with quasi-transitive chromatic classes.

Cites work

• scientific article; zbMATH DE number 3891402 (Why is no real title available?)
• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• A new method to extend kernel-perfect graphs to kernel-perfect critical graphs
• A note on kernel-critical graphs
• A sufficient condition for a digraph to be kernel-perfect
• Extending kernel perfect digraphs to kernel perfect critical digraphs
• Extension Theorems for Solutions of Irreflexive Relations
• Graphes Noyau-Parfaits
• Kernels in edge coloured line digraph
• Kernels in edge-colored digraphs
• On kernel-perfect critical digraphs
• On kernels and semikernels of digraphs
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• On monochromatic paths in m-coloured tournaments
• Solutions of irreflexive relations
• Some operations preserving the existence of kernels

Cited in

(8)

• Monochromatic paths on edge colored digraphs and state splittings
• Alternating kernels
• \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
• \(H\)-kernels by walks in subdivision digraph
• H-kernels by walks in an \(R_H (D)\) digraph
• On kernels by monochromatic paths in \(D\)-join.
• Kernels in edge-coloured orientations of nearly complete graphs
• A new generalization of kernels in digraphs

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

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