On panchromatic digraphs and the panchromatic number
From MaRDI portal
Publication:489347
DOI10.1007/S00373-013-1367-ZzbMATH Open1306.05059arXiv1504.06596OpenAlexW2166194148MaRDI QIDQ489347FDOQ489347
Ricardo Strausz, Hortensia Galeana-Sánchez
Publication date: 20 January 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1504.06596
Recommendations
Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- On monochromatic paths in edge-coloured digraphs
- Perfect graphs, kernels, and cores of cooperative games
- Title not available (Why is that?)
- On monochromatic paths in m-coloured tournaments
- Kernels in edge-colored digraphs
- A counterexample to a conjecture on edge-coloured tournaments
- On monochromatic paths and monochromatic cycles in edge coloured tournaments
- Recent problems and results about kernels in directed graphs
- Combinatorial games: Selected bibliography with a succinct gourmet introduction
- Absorbing sets in arc-coloured tournaments
Cited In (2)
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)