Edge‐colored complete graphs without properly colored even cycles: A full characterization

The structure of edge‐colored complete graphs containing no properly colored triangles has been characterized by Gallai back in the 1960s. More recently, Cǎda et al. and Fujita et al. independently determined the structure of edge‐colored complete bipartite graphs containing no properly colored C 4....

Full description

Saved in:
Bibliographic Details
Published inJournal of graph theory Vol. 98; no. 1; pp. 110 - 124
Main Authors Li, Ruonan, Broersma, Hajo, Yokota, Maho, Yoshimoto, Kiyoshi
Format Journal Article
LanguageEnglish
Published Hoboken Wiley Subscription Services, Inc 01.09.2021
Subjects
complete graph
edge‐colored graph
forbidden subgraph
Graph coloring
Graphs
properly colored cycle
Structural analysis
Online AccessGet full text

Cover

More Information
Summary:The structure of edge‐colored complete graphs containing no properly colored triangles has been characterized by Gallai back in the 1960s. More recently, Cǎda et al. and Fujita et al. independently determined the structure of edge‐colored complete bipartite graphs containing no properly colored C 4. We characterize the structure of edge‐colored complete graphs containing no properly colored even cycles, or equivalently, without a properly colored C 4 or C 6. In particular, we first deal with the simple case of 2‐edge‐colored complete graphs, using a result of Yeo. Next, for k ≥ 3, we define four classes of k‐edge‐colored complete graphs without properly colored even cycles and prove that any k‐edge‐colored complete graph without a properly colored even cycle belongs to one of these four classes.
ISSN:0364-9024
1097-0118
DOI:10.1002/jgt.22684