Mostra el registre d'ítem simple
3-colorability of pseudo-triangulations
dc.contributor.author | Aichholzer, Oswin |
dc.contributor.author | Aurenhammer, Franz |
dc.contributor.author | Hackl, Thomas |
dc.contributor.author | Huemer, Clemens |
dc.contributor.author | Pilz, Alexander |
dc.contributor.author | Vogtenhuber, Birgit |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2016-04-06T10:04:57Z |
dc.date.available | 2016-12-06T01:30:58Z |
dc.date.issued | 2015 |
dc.identifier.citation | Aichholzer, O., Aurenhammer, F., Hackl, T., Huemer, C., Pilz, A., Vogtenhuber, B. 3-colorability of pseudo-triangulations. "International journal of computational geometry and applications", 2015, vol. 25, núm. 4, p. 283-298. |
dc.identifier.issn | 0218-1959 |
dc.identifier.uri | http://hdl.handle.net/2117/85279 |
dc.description | Electronic version of an article published as International Journal of Computational Geometry & Applications, Vol. 25, No. 4 (2015) 283–298 DOI: 10.1142/S0218195915500168 © 2015 World Scientific Publishing Company. http://www.worldscientific.com/worldscinet/ijcga |
dc.description.abstract | Deciding 3-colorability for general plane graphs is known to be an NP-complete problem. However, for certain families of graphs, like triangulations, polynomial time algorithms exist. We consider the family of pseudo-triangulations, which are a generalization of triangulations, and prove NP-completeness for this class. This result also holds if we bound their face degree to four, or exclusively consider pointed pseudo-triangulations with maximum face degree five. In contrast to these completeness results, we show that pointed pseudo-triangulations with maximum face degree four are always 3-colorable. An according 3-coloring can be found in linear time. Some complexity results relating to the rank of pseudo-triangulations are also given. |
dc.format.extent | 16 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 |
dc.subject.lcsh | Graph theory |
dc.subject.other | pseudo-triangulation |
dc.subject.other | 3-colorability |
dc.subject.other | face degree |
dc.title | 3-colorability of pseudo-triangulations |
dc.type | Article |
dc.subject.lemac | Grafs, Teoria de |
dc.contributor.group | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
dc.identifier.doi | 10.1142/S0218195915500168 |
dc.relation.publisherversion | http://www.worldscientific.com/worldscinet/ijcga |
dc.rights.access | Open Access |
local.identifier.drac | 17531745 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Aichholzer, O.; Aurenhammer, F.; Hackl, T.; Huemer, C.; Pilz, A.; Vogtenhuber, B. |
local.citation.publicationName | International journal of computational geometry and applications |
local.citation.volume | 25 |
local.citation.number | 4 |
local.citation.startingPage | 283 |
local.citation.endingPage | 298 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [85]
-
Articles de revista [3.234]