Kernels in the closure of coloured digraphs
The closure of an arc coloured digraph \(D=(V,A)\) is defined as the coloured multidigraph \(\zeta(D)=(V,B),\) where \(B=\bigcup_i\{(u,v)\) with the colour \(i\) : there exists a monochromatic path of colour \(i\) from \(u\) to \(v\) in \(D\)\}. Let \(C_3\) denote the class of all 3-coloured (i.e. coloured with 3 different colours) directed cycles of order~3 and let \(T_3\) denote the class of all 3-coloured transitive tournaments of order 3. The authors prove that if \(D\) is obtained from an arc coloured tournament by deleting one arc and \(D\) is \(\{C_3\cup T_3\}\)-free, then every induced subdigraph of its closure \(\zeta(D)\) has a kernel (i.e. independent and absorbent set of vertices).
- Cycles and transitivity by monochromatic paths in arc-coloured digraphs
- On graphs all of whose \(\{C_3,T_3\}\)-free arc colorations are kernel-perfect
- Kernels in edge-colored digraphs
- Monochromatic cycles and monochromatic paths in arc-colored digraphs
- Kernels by monochromatic directed paths in 3-colored tournaments and quasi-tournaments
- On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments
- Perfect graphs, kernels, and cores of cooperative games
- \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
- Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments
- On graphs all of whose \(\{C_3,T_3\}\)-free arc colorations are kernel-perfect
- New classes of panchromatic digraphs
- \(\Gamma\)-cycles in arc-colored digraphs
- Kernels in edge-coloured orientations of nearly complete graphs
This page was built for publication: Kernels in the closure of coloured digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2725188)
