✦ LIBER ✦

Representing Groups by Colourings of Graphs

✍ Scribed by Ulrike Baumann

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 297 KB
Volume: 188
Category: Article
ISSN: 0025-584X
DOI: 10.1002/mana.19971880103

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Representation of Permutation Groups by

Representation of Permutation Groups by Coloured Graphs

✍ Ulrike Baumann 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 432 KB

## Abstract The topic of this paper is representing permutation groups by connected graphs with proper edge colourings. Every connected graph __G__ with a proper edge colouring ϕ determines a group __A~c~__(__G__, ϕ) of graph automorphisms which preserve the colours of the edges. We characterize pe

Symmetry Groups of Coloured Graphs

✍ Ulrike Baumann 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 474 KB

## Abstract A perfect colouring Φ of a simple undirected connected graph __G__ is an edge colouring such that each vertex is incident with exactly one edge of each colour. This paper concerns the problem of representing groups by graphs with perfect colourings. We define groups of graph automorphis

Total Colourings of Planar Graphs with L

Total Colourings of Planar Graphs with Large Girth

✍ O.V. Borodin; A.V. Kostochka; D.R. Woodall 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 96 KB

It is proved that if G is a planar graph with total (vertex-edge) chromatic number χ , maximum degree and girth g, then χ = + 1 if ≥ 5 and g ≥ 5, or ≥ 4 and g ≥ 6, or ≥ 3 and g ≥ 10. These results hold also for graphs in the projective plane, torus and Klein bottle.

Circular Colouring and Orientation of Gr

Circular Colouring and Orientation of Graphs

✍ Xuding Zhu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 88 KB

This paper proves that if a graph G has an orientation D such that for each cycle C with djCj ðmod kÞ 2 f1; 2; . . . ; 2d À 1g we have jCj=jC þ j4k=d and jCj=jC À j4k=d; then G has a ðk; dÞ-colouring and hence w c ðGÞ4k=d: This is a generalization of a result of Tuza (J. Combin. Theory Ser. B 55 (19

Automorphism Groups of Covering Graphs

✍ Norbert Seifter; Vladimir I. Trofimov 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 226 KB

For a large class of finite Cayley graphs we construct covering graphs whose automorphism groups coincide with the groups of lifted automorphisms. As an application we present new examples of 1Â2-transitive and 1-regular graphs.

Representing the Quotient Groups of a Fi

Representing the Quotient Groups of a Finite Permutation Group

✍ Derek F. Holt; Jacqueline Walton 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Let G be a permutation group of finite degree d. We prove that the product of the orders of the composition factors of G that are not alternating groups acting naturally, in a sense that will be made precise, is bounded by c d-1 /d, where c = 4 5. We use this to prove that any quotient G/N of G has