Author:
Ağaoğlu Deniz,Çağırıcı Onur
Publisher
Springer International Publishing
Reference16 articles.
1. Berg, M., Cheong, O., Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn., pp. 323–333. Springer, Heidelberg (2008). TELOS, Chap. 15, ISBN 3540779736. https://doi.org/10.1007/978-3-540-77974-2
2. Cardinal, J., Hoffmann, U.: Recognition and complexity of point visibility graphs. Discrete Comput. Geomet. 57, 164–178 (2017)
3. Çağırıcı, O., Hliněný, P., Roy, B.: On colourability of polygon visibility graphs. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 21:1–21:13 (2017)
4. da Fonseca, G.D., de Sa, V.G.P., Machado, R.C.S., de Figueiredo, C.M.H.: On the recognition of unit disk graphs and the distance geometry problem with Ranges. Discrete Appl. Math. 197, 3–19 (2015)
5. Dailey, D.P.: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Discrete Math. 30, 289–293 (1980)