The Diameter of undirected graphs associated to plane tessellations
Rights accessOpen Access
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
Thi s paper studi es the di ameter of sorne fami I i es of undirected graphs that can be associated to plane tessel lations which fu1 ly represent them. More precisely, we concentrate upon maximizing the order of the graphs for given values of their diameter and degree, where the study always leads to the optima'l solutions.
CitationAndrés, J. [et al.]. The Diameter of undirected graphs associated to plane tessellations. "Ars combinatoria", 1985, vol. 20B, p. 159-171.
|ArsC-1985 (graphs-tesel).pdf||Article principal||13,51Mb||View/Open|