✦ LIBER ✦

Chromatic automorphisms and symmetries of some graphs

✍ Scribed by S. Stueckle

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 481 KB
Volume: 80
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90118-2

No coin nor oath required. For personal study only.

✦ Synopsis

Certain colored graphs are defined in terms of permutations in S, and the edge-chromatic automorphism groups of these graphs are studied. In fact, these groups are characterized in terms of the associated permutations. These groups are related to the groups of symmetries of certain drawings of cycles in the plane.

📜 SIMILAR VOLUMES

Chromatic automorphisms of graphs

✍ V Chvátal; J Sichler 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 361 KB

Symmetries of drawings of sets of cycles

Symmetries of drawings of sets of cycles and chromatic automorphisms

✍ L. Wang; S. Stueckle 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 429 KB

Certain colored graphs are defined in terms of permutations in S. and the edge-chromatic automorphism groups of these graphs are studied. In fact, these groups are characterized in terms of the associated permutations. These groups are related to the groups of symmetries of certain drawings of sets

Star chromatic numbers of some planar gr

Star chromatic numbers of some planar graphs

✍ Gao, Guogang; Wang, Yiju; Zhou, Huishan 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB 👁 2 views

The concept of the star chromatic number of a graph was introduced by Vince (A. Vince, Star chromatic number, J. Graph Theory 12 (1988), 551--559), which is a natural generalization of the chromatic number of a graph. This paper calculates the star chromatic numbers of three infinite families of pla

Automorphisms of graphs and coverings

✍ D.Z̆ Djoković 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 242 KB

Circular chromatic numbers of some reduc

Circular chromatic numbers of some reduced Kneser graphs

✍ Ko-Wei Lih; Daphne Der-Fen Liu 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 75 KB

## Abstract The vertex set of the reduced Kneser graph KG~2~(__m,2__) consists of all pairs {__a,b__} such that __a, b__ε{1,2,…,__m__} and 2≤|__a__−__b__|≤__m__−2. Two vertices are defined to be adjacent if they are disjoint. We prove that, if __m__≥4 __and m__≠5, then the circular chromatic number

Some inequalities on the chromatic numbe

Some inequalities on the chromatic number of a graph

✍ T. King; G.L. Nemhauser 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 567 KB