Paper Info
Title
Domination in transitive colorings of tournaments.
Abstract
An edge coloring of a tournament T with colors 1,2,…,k is called k-transitive if the digraph T(i) defined by the edges of color i is transitively oriented for each 1⩽i⩽k. We explore a conjecture of the second author: For each positive integer k there exists a (least) p(k) such that every k-transitive tournament has a dominating set of at most p(k) vertices.
Year
DOI
Venue
2013
10.1016/j.jctb.2014.02.001
Journal of Combinatorial Theory, Series B
Keywords
DocType
Volume
Domination,Transitive tournaments
Journal
107
ISSN
Citations 
PageRank 
0095-8956
4
0.56
References 
Authors
9
2
Name
Order
Citations
PageRank
Dömötör Pálvölgyi120229.14
András Gyárfás2582102.26