On panchromatic patterns

descriptionPublicationkeyboard_double_arrow_right Article , Preprint 01 Oct 2016Embargo end date: 01 Apr 2015 English Publisher:Elsevier BVJournal:Discrete Mathematics, volume 339, pages 2,536-2,542 (issn: 0012-365X,

Copyright policy )

Authors: Hortensia Galeana-Sánchez; Ricardo Strausz;

doi: 10.1016/j.disc.2016.03.014 , 10.48550/arxiv.1504.06596

arXiv: 1504.06596

On panchromatic patterns

- Summary
- Subjects
- Metrics

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.

Related Organizations

National Autonomous University of Mexico
Mexico
Universidad Autónoma de la Ciudad de México
Mexico

Keywords

Coloring of graphs and hypergraphs, FOS: Mathematics, Directed graphs (digraphs), tournaments, panchromatic patterns, Mathematics - Combinatorics, 05C20, Combinatorics (math.CO), kernels in digraphs

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	4
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average