A particular kind of 2-cell imbeddings, called regular, for edge-coloured graphs is introduced. By using both combinatorial and geometric techniques, some general imbedding theorems for such graphs, strictly related to the polyhedra they represent, are exposed.
Regular imbeddings of edge-coloured graphs / Gagliardi, Carlo. - In: GEOMETRIAE DEDICATA. - ISSN 0046-5755. - STAMPA. - 11:(1981), pp. 397-414.
Regular imbeddings of edge-coloured graphs
GAGLIARDI, Carlo
1981-01-01
Abstract
A particular kind of 2-cell imbeddings, called regular, for edge-coloured graphs is introduced. By using both combinatorial and geometric techniques, some general imbedding theorems for such graphs, strictly related to the polyhedra they represent, are exposed.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
