✦ LIBER ✦

Totally symmetric colored graphs

✍ Scribed by Mariusz Grech; Andrzej Kisielewicz

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 177 KB
Volume: 62
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20397

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

In this paper we describe almost all edge‐colored complete graphs that are fully symmetric with respect to colors and transitive on every set of edges of the same color. This generalizes the recent description of self‐complementary symmetric graphs by Peisert and gives examples of permutation groups that require more than 5 colors to be represented as the automorphism group of a k ‐colored graph. This also contributes to the recent study of homogeneous factorizations of complete graphs. The result relies on the classification of finite simple groups. © 2009 Wiley Periodicals, Inc. J Graph Theory 62: 329–345, 2009

📜 SIMILAR VOLUMES

On Total Colorings of Graphs

✍ C. Mcdiarmid; B. Reed 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 299 KB

AND Bruce Reed Department of Combinatorics and Optimisation, University of Waterloo, Waterloo, Ontario, Canada

Colored Homomorphisms of Colored Mixed G

Colored Homomorphisms of Colored Mixed Graphs

✍ Jaroslav Nešetřil; André Raspaud 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 108 KB

The homomorphisms of oriented or undirected graphs, the oriented chromatic number, the relationship between acyclic coloring number and oriented chromatic number, have been recently studied. Improving and combining earlier techniques of N.

Edge-colored saturated graphs

✍ D. Hanson; B. Toft 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB

A decomposition for total-coloring parti

A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs

✍ Raphael C. S. Machado; Celina M. H. de Figueiredo 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 285 KB

Domination in colored complete graphs

✍ P. Erdös; R. Faudree; A. Gyárfás; R. H. Schelp 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB

Average distance in colored graphs

✍ Peter Dankelmann; Wayne Goddard; Peter Slater 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

## Abstract For a graph __G__ where the vertices are colored, the __colored distance__ of __G__ is defined as the sum of the distances between all unordered pairs of vertices having different colors. Then for a fixed supply __s__ of colors, __d~s~(G)__ is defined as the minimum colored distance ove