Carregant...
Carregant...

Vés al contingut (premeu Retorn)

On Hamiltonian alternating cycles and paths

Autor
Claverol, M.; García, A.; Garijo, D.; Seara, C.; Tejel, J.
Tipus d'activitat
Article en revista
Revista
Computational geometry: theory and applications
Data de publicació
2018-03
Volum
68
Pàgina inicial
146
Pàgina final
166
DOI
https://doi.org/10.1016/j.comgeo.2017.05.009 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/112128 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S0925772117300421?via%3Dihub Obrir en finestra nova
Resum
We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this paper, we relax the constraint on the cycles and paths from being plane to being 1-plane, and deal with the same type of questions as those for the plane case, obtaining a remarkable variety of results. For point sets in general position, our main result is tha...
Paraules clau
Bicolored Point Sets, Hamiltonian Alternating Cycles And Paths, 1-plane Graphs, Minimum Number Of Crossings
Grup de recerca
DCCG - Grup de recerca en geometria computacional, combinatoria i discreta

Participants