Mathematics – Combinatorics
Scientific paper
2012-01-21
Mathematics
Combinatorics
13 pages
Scientific paper
In this paper we describe all edge-colored graphs that are fully symmetric with respect to colors and transitive on every set of edges of the same color. They correspond to fully symmetric homogeneous factorizations of complete graphs. Our description completes the work done in our previous paper, where we have shown, in particular, that there are no such graphs with more than 5 colors. Using some recent results, with a help of computer, we settle all the cases that was left open in the previous paper.
Grech Mariusz
Kisielewicz Andrzej
No associations
LandOfFree
All totally symmetric colored graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with All totally symmetric colored graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and All totally symmetric colored graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-134906