Kernels in edge-coloured orientations of nearly complete graphs
type: Item
instance of: scholarly article
title: Kernels in edge-coloured orientations of nearly complete graphs
zbMATH Open document ID: 1152.05028
published in: Discrete Mathematics
publication date: 2008-09-04T00:00:00Z
review text: The digraph \(D\) is an orientation of a graph \(G\) if \(D\) is obtained from \(G\) by the orientation of each edge of \(G\) in exactly one of the two possible directions. The digraph \(D\) is an \(m\)-colored digraph if the arcs of \(D\) are colored with \(m\)-colors. A directed path or a directed cycle is said to be monochromatic if all of its arcs are colored alike. The paper gives sufficient conditions for an \(m\)-colored orientation of a graph obtained from the \(n\)-vertex complete graph by the deletion of \(r\) arcs all of them incident with a vertex \(x\), \(r < n\), to have a kernel by monochromatic paths.
reviewed by: Wai-Kai Chen
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5321333
zbMATH Keywords: kernel
zbMATH Keywords: kernel by monochromatic paths
zbMATH Keywords: orientation
author: Hortensia Galeana-Sánchez
MaRDI profile type: Publication
full work available at URL: j.disc.2007.08.079
OpenAlex ID: W2086453403
cites work: Q4099676
cites work: On monochromatic paths and monochromatic cycles in edge coloured tournaments
cites work: Kernels in edge-colored digraphs
cites work: Kernels in the closure of coloured digraphs
cites work: On graphs all of whose \(\{C_3,T_3\}\)-free arc colorations are kernel-perfect
cites work: A counterexample to a conjecture on edge-coloured tournaments
cites work: Absorbing sets in arc-coloured tournaments
cites work: On monochromatic paths in m-coloured tournaments
cites work: On monochromatic paths in edge-coloured digraphs
DOI: 10.1016/J.DISC.2007.08.079
description: scientific article; zbMATH DE number 5321333