Mostra el registre d'ítem simple
Geometric biplane graphs I: maximal graphs
dc.contributor.author | Garcia Olaverri, Alfredo Martin |
dc.contributor.author | Hurtado Díaz, Fernando Alfredo |
dc.contributor.author | Korman Cozzetti, Matías |
dc.contributor.author | Matos, Inés P. |
dc.contributor.author | Saumell, Maria |
dc.contributor.author | Silveira, Rodrigo Ignacio |
dc.contributor.author | Tejel Altarriba, Francisco Javier |
dc.contributor.author | Tóth, Csaba D. |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2015-12-18T10:43:09Z |
dc.date.available | 2017-03-31T00:30:30Z |
dc.date.issued | 2015-03-01 |
dc.identifier.citation | Garcia, A., Hurtado, F., Korman, M., Matos, I. P., Saumell, M., Silveira, R.I., Tejel, F., Tóth, C.D. Geometric biplane graphs I: maximal graphs. "Graphs and combinatorics", 01 Març 2015, vol. 31, núm. 2, p. 407-425. |
dc.identifier.issn | 0911-0119 |
dc.identifier.uri | http://hdl.handle.net/2117/80896 |
dc.description.abstract | We study biplane graphs drawn on a finite planar point set in general position. This is the family of geometric graphs whose vertex set is and can be decomposed into two plane graphs. We show that two maximal biplane graphs-in the sense that no edge can be added while staying biplane-may differ in the number of edges, and we provide an efficient algorithm for adding edges to a biplane graph to make it maximal. We also study extremal properties of maximal biplane graphs such as the maximum number of edges and the largest maximum connectivity over -element point sets. |
dc.format.extent | 19 p. |
dc.language.iso | eng |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional |
dc.subject.lcsh | Geometric group theory |
dc.subject.other | Geometric graphs |
dc.subject.other | Biplane graphs |
dc.subject.other | Maximal biplane graphs |
dc.subject.other | k-Connected graphs |
dc.subject.other | Graph augmentation |
dc.subject.other | PLANAR GRAPHS |
dc.subject.other | CONNECTIVITY |
dc.title | Geometric biplane graphs I: maximal graphs |
dc.type | Article |
dc.subject.lemac | Geometria computacional |
dc.contributor.group | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
dc.identifier.doi | 10.1007/s00373-015-1546-1 |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | Classificació AMS::30 Functions of a complex variable::30C Geometric function theory |
dc.rights.access | Open Access |
local.identifier.drac | 15608802 |
dc.description.version | Postprint (author's final draft) |
dc.relation.projectid | info:eu-repo/grantAgreement/MICINN/EUI/EURC-2011-4306 |
local.citation.author | Garcia, A.; Hurtado, F.; Korman, M.; Matos, I. P.; Saumell, M.; Silveira, R.I.; Tejel, F.; Tóth, C.D. |
local.citation.publicationName | Graphs and combinatorics |
local.citation.volume | 31 |
local.citation.number | 2 |
local.citation.startingPage | 407 |
local.citation.endingPage | 425 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [85]
-
Articles de revista [3.259]