RECERCAT Principal
>
Universitat Politècnica de Catalunya
>
Documents de recerca
>
Visualizar documento
Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/85279
| dc.contributor | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
|---|---|
| dc.contributor | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
| 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.date | 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.citation | 0218-1959 |
| dc.identifier.citation | 10.1142/S0218195915500168 |
| dc.identifier.uri | http://hdl.handle.net/2117/85279 |
| dc.description.abstract | 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.language.iso | eng |
| dc.relation | http://www.worldscientific.com/worldscinet/ijcga |
| dc.rights | info:eu-repo/semantics/openAccess |
| dc.rights | 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 | Graph theory |
| dc.subject | pseudo-triangulation |
| dc.subject | 3-colorability |
| dc.subject | face degree |
| dc.subject | Grafs, Teoria de |
| dc.title | 3-colorability of pseudo-triangulations |
| dc.type | info:eu-repo/semantics/submittedVersion |
| dc.type | info:eu-repo/semantics/article |
Documentos relacionados
Otros documentos del mismo autor/a
Aichholzer, Oswin; Fabila Monroy, Ruy; Hackl, Thomas; Huemer, Clemens; Pilz, Alexander; Vogtenhuber, Birgit
Aichholzer, Oswin; Cardinal, Jean; Hackl, Thomas; Hurtado Díaz, Fernando Alfredo; Korman Cozzetti, Matías; Pilz, Alexander; Silveira, Rodrigo Ignacio; Uehara, Ryuhei; Vogtenhuber, Birgit; Welzl, Emo
Aichholzer, Oswin; Hackl, Thomas; Pilz, Alexander; Ramos Alonso, Pedro Antonio; Sacristán Adinolfi, Vera; Vogtenhuber, Birgit
Aichholzer, Oswin; Hackl, Thomas; Hoffmann, Michael; Huemer, Clemens; Pór, Attila; Santos, Francisco; Speckmann, Bettina; Vogtenhuber, Birgit
Aichholzer, Oswin; Fabila Monroy, Ruy; Gonzalez Aguilar, Hernan; Hackl, Thomas; Heredia, Marco A.; Huemer, Clemens; Urrutia Galicia, Jorge; Valtr, Pavel; Vogtenhuber, Birgit