Vertex orders

  • Leo LibertiEmail author
  • Carlile Lavor
Part of the Springer Undergraduate Texts in Mathematics and Technology book series (SUMAT)


In this chapter, we address the question: given a graph, does it have a trilateration order? And if so, is it contiguous? Unlike the DGP, which is not known to be in NP, these order existence problems are both in NP: if a graph is a YES instance, a suitable vertex order can be verified to be correct in polytime, by simply checking that it has enough adjacent predecessors.

Copyright information

© Springer International Publishing Switzerland 2017

Authors and Affiliations

  1. 1.CNRS LIXÉcole PolytechniquePalaiseauFrance
  2. 2.Department of Applied Mathematics, IMECC-UNICAMPUniversity of CampinasCampinasBrazil

Personalised recommendations