On panchromatic digraphs and the panchromatic number
From MaRDI portal
(Redirected from Publication:489347)
Abstract: Given D and H two digraphs, D is H-coloured iff the arcs of D are coloured with the vertices of H. After defining what do we mean by an H-walk in the coloured D, we characterise those H, which we call panchromatic patterns, for which all D and all H-colourings of D admit a kernel by H-walks. This solves a problem of Arpin and Linek from 2007.
Recommendations
Cites work
- scientific article; zbMATH DE number 1498519 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- A counterexample to a conjecture on edge-coloured tournaments
- Absorbing sets in arc-coloured tournaments
- Combinatorial games: Selected bibliography with a succinct gourmet introduction
- Kernels in edge-colored 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
- Perfect graphs, kernels, and cores of cooperative games
- Recent problems and results about kernels in directed graphs
This page was built for publication: On panchromatic digraphs and the panchromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489347)