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.









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)