Coloring Groups

We introduce coloring groups, which are permutation groups obtained from a proper edge coloring of a graph. These groups generalize the generalized toggle groups of Striker (which themselves generalize the toggle groups introduced by Cameron and Fon-der-Flaass). We present some general results conne...

Full description

Saved in:
Bibliographic Details
Main Authors: Ben Adenbaum, Alexander Wilson
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2024-07-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
Online Access:http://dmtcs.episciences.org/12753/pdf
Tags: Add Tag
No Tags, Be the first to tag this record!