Paper Info
Title
Edge colorings of complete graphs without tricolored triangles
Abstract
We show some consequences of results of Gallai concerning edge colorings of complete graphs that contain no tricolored triangles. We prove two conjectures of Bialostocki and Voxman about the existence of special monochromatic spanning trees in such colorings. We also determine the size of largest monochromatic stars guaranteed to occur. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 211–216, 2004
Year
DOI
Venue
2004
10.1002/jgt.v46:3
Journal of Graph Theory
Field
DocType
Volume
Ramsey theory,Graph theory,Discrete mathematics,Graph,Topology,Monochromatic color,Combinatorics,Spanning tree,Greedy coloring,Mathematics
Journal
46
Issue
Citations 
PageRank 
3
32
2.50
References 
Authors
4
2
Name
Order
Citations
PageRank
András Gyárfás1582102.26
Gábor Simonyi224929.78