Extensions of Gallai–Ramsey results

Document Type

Article

Publication Date

8-2012

Publication Title

Journal of Graph Theory

DOI

10.1002/jgt.20622

ISSN

1097-0118

Abstract

Consider the graph consisting of a triangle with a pendant edge. We describe the structure of rainbow -free edge colorings of a complete graph and provide some corresponding Gallai–Ramsey results. In particular, we extend a result of Gallai to find a partition of the vertices of a rainbow -free colored complete graph with a limited number of colors between the parts. We also extend some Gallai–Ramsey results of Chung and Graham, Faudree et al. and Gyárfás et al.

Link to Full Text

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 22
  • Usage
    • Abstract Views: 25
  • Captures
    • Readers: 5
see details

Share

COinS