𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Symmetries of drawings of sets of cycles and chromatic automorphisms

✍ Scribed by L. Wang; S. Stueckle

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
429 KB
Volume
128
Category
Article
ISSN
0012-365X

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 sets of cycles in the plane.

πŸ“œ SIMILAR VOLUMES

Chromatic automorphisms and symmetries o
Chromatic automorphisms and symmetries of some graphs
✍ S. Stueckle πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 481 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 cycle

The mean chromatic number of paths and c
The mean chromatic number of paths and cycles
✍ Martin Anthony; Norman Biggs πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 245 KB

The mean chromatic number of a graph is defined. This is a measure of the expected performance of the greedy vertex-colouring algorithm when each ordering of the vertices is equally likely. In this note, we analyse the asymptotic behaviour of the mean chromatic number for the paths and even cycles,

The number of shortest cycles and the ch
The number of shortest cycles and the chromatic uniqueness of a graph
✍ C. P. Teo; K. M. Koh πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 403 KB πŸ‘ 2 views

## Abstract For a graph __G__, let __g__(__G__) and Οƒ~g~(__G__) denote, respectively, the girth of __G__ and the number of cycles of length __g__(__G__) in __G__. In this paper, we first obtain an upper bound for Οƒ~g~(__G__) and determine the structure of a 2‐connected graph __G__ when Οƒ~g~(__G__)