Gallai Multigraphs
classification
🧮 math.CO
keywords
gallaimultigraphscalledcompleteconstructionedge-coloredfinitegive
read the original abstract
A complete edge-colored graph or multigraph is called Gallai if it lacks rainbow triangles. We give a construction of all finite Gallai multigraphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.