Premium
Remarkable Groups of Graphs with Edge Colourings
Author(s) -
Baumann Ulrike,
Lesch Manfred,
Schmeichel Irmgard
Publication year - 1990
Publication title -
mathematische nachrichten
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.913
H-Index - 50
eISSN - 1522-2616
pISSN - 0025-584X
DOI - 10.1002/mana.3211480110
Subject(s) - mathematics , combinatorics , automorphism , partition (number theory) , vertex (graph theory) , permutation group , permutation (music) , graph , enhanced data rates for gsm evolution , discrete mathematics , computer science , artificial intelligence , physics , acoustics
Every edge colouring of a graph G determines permutation groups on the vertex set of G. Groups of colour preserving automorphisms and groups of partition preserving automorphlums are especially interesting. The paper deals with relations between these groups and a permutation group investigated by N. L. Biggs.