Skip to Main content Skip to Navigation
Journal articles

All totally symmetric colored graphs

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Tuesday, May 13, 2014 - 4:29:00 PM
Last modification on : Saturday, November 21, 2020 - 9:54:03 AM
Long-term archiving on: : Monday, April 10, 2017 - 10:33:38 PM


Files produced by the author(s)




Mariusz Grech, Andrzej Kisielewicz. All totally symmetric colored graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2013, Vol. 15 no. 1 (1), pp.133--145. ⟨10.46298/dmtcs.630⟩. ⟨hal-00990612⟩



Record views


Files downloads