Opis: In this note we give a construction proving that the Gray graph, which is the smallestcubic semisymmetric graph, is a unit-distance graph.Ključne besede: polycirculant, unit-distance graph, Gray graph, ADAM graph, generalized Petersen graphObjavljeno v RUP: 10.09.2025; Ogledov: 1268; Prenosov: 30 Celotno besedilo (951,83 KB)
Ključne besede: plane-width, realization of a graph, packing non-overlapping unit disks, chromatic number, circular chromatic numberObjavljeno v RUP: 15.10.2013; Ogledov: 5421; Prenosov: 92 Povezava na celotno besedilo
