Gallai colorings of non-complete graphs
type: Item
instance of: scholarly article
title: Gallai colorings of non-complete graphs
zbMATH Open document ID: 1230.05128
author: András Gyárfás
author: Gábor N. Sárközy
published in: Discrete Mathematics
publication date: 2010-04-27T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5701991
zbMATH Keywords: Gallai colorings
zbMATH Keywords: monochromatic connected components
MaRDI profile type: Publication
full work available at URL: j.disc.2009.10.013
OpenAlex ID: W1979911458
cites work: A note on perfect graphs
cites work: Maximum degree and fractional matchings in uniform hypergraphs
cites work: Transitiv orientierbare Graphen
cites work: Large Monochromatic Components in Edge Colorings of Graphs: A Survey
cites work: Ramsey-type results for Gallai colorings
cites work: Edge colorings of complete graphs without tricolored triangles
cites work: The Ramsey number R(3, t) has order of magnitude t2/log t
cites work: Graph pairs and their entropies: Modularity problems
cites work: Perfect couples of graphs
cites work: A translation of Gallai's paper: `Transitiv orientierbare Graphen'
cites work: Q4339095
DOI: 10.1016/J.DISC.2009.10.013
description: scientific article; zbMATH DE number 5701991