Chromatic automorphisms and symmetries of some graphs (Q911613)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Chromatic automorphisms and symmetries of some graphs |
scientific article; zbMATH DE number 4142071
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chromatic automorphisms and symmetries of some graphs |
scientific article; zbMATH DE number 4142071 |
Statements
Chromatic automorphisms and symmetries of some graphs (English)
0 references
1990
0 references
The edge-chromatic automorphism group of an edge-colored graph G is the subgroup of the full automorphism group of G consisting of the color- preserving automorphisms. Two classes of edge-colored graphs are defined, in terms of permutations in \(S_ n\), and the edge-chromatic automorphism groups of graphs in these classes 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.
0 references
edge-chromatic automorphism group
0 references
edge-colored graph
0 references
permutations
0 references
drawings of cycles in the plane
0 references
