Gallai Multigraphs

Simple item page
dc.creatorPula, Kyle
dc.date2007-06-30
dc.date.accessioned2026-07-07T08:13:16Z
dc.date.available2026-07-07T08:13:16Z
dc.descriptionA complete edge-colored graph or multigraph is called Gallai if it lacks rainbow triangles. We give a construction of all finite Gallai multigraphs.
dc.description16 pages, 5 figures
dc.identifierhttps://arxiv.org/abs/0707.0084
dc.identifierhttp://arxiv.org/abs/0707.0084
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/132746
dc.subjectCombinatorics
dc.subject05C15; 05C55
dc.titleGallai Multigraphs
dc.typetext

Files

Collections

arXiv