Document Type

Article

Publication Date

2014

Publication Title

Discussiones Mathematicae Graph Theory

DOI

10.7151/dmgt.1740

ISSN

2083-5892

Abstract

An edge-colored cycle is rainbow if its edges are colored with distinct colors. A Gallai (multi)graph is a simple, complete, edge-colored (multi)graph lacking rainbow triangles. As has been previously shown for Gallai graphs, we show that Gallai multigraphs admit a simple iterative construction. We then use this structure to prove Ramsey-type results within Gallai colorings. Moreover, we show that Gallai multigraphs give rise to a surprising and highly structured decomposition into directed trees.

Comments

This article is under the http://creativecommons.org/licenses/by-nc-nd/3.0/. Article obtained from Discussiones Mathematicae Graph Theory.

Download

Share

COinS