On the computational complexity of degenerate unit distance representations of graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6460 LNCS, Issue , 2011, Pages 274-285

  Horvat, Boris ^a   Kratochvíl, Jan ^b   Pisanski, Tomaž ^a,c  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

^b CHARLES UNIVERSITY   (Czech Republic)

^c UNIVERSITY OF PRIMORSKA   (Slovenia)

Author keywords

complexity; degenerate representation; the dimension of a graph; the Euclidean dimension of a graph; unit distance graph

Indexed keywords

COMPLEXITY; DEGENERATE REPRESENTATION; EUCLIDEAN DIMENSIONS; THE DIMENSION OF A GRAPH; UNIT DISTANCE GRAPH;

ALGORITHMS; COMBINATORIAL MATHEMATICS;

COMPUTATIONAL COMPLEXITY;

EID: 79953186086     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19222-7_28     Document Type: Conference Paper

References (16)

1. Boben, M., Pisanski, T.: Polycyclic configurations. European J. Combin. 24(4), 431-457 (2003)
2. Buckley, F., Harary, F.: On the Euclidean dimension of a Wheel. Graphs Combin. 4, 23-30 (1988)
3. Cabello, S., Demaine, E., Rote, G.: Planar embeddings of graphs with specified edge lengths. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 283-294. Springer, Heidelberg (2004)
4. Eades, P., Whitesides, S.: The logic engine and the realization problem for nearest neighbor graphs. Theor. Comput. Sc. 169(1), 23-37 (1996)
5. Eades, P., Wormald, N.C.: Fixed edge-length graph drawing is NP-hard. Discrete Appl. Math. 28(2), 111-134 (1990)
6. Eppstein, D.: Blog entry (January 2010), http://11011110.livejournal.com/ 188807.html
7. Erdös, P., Harary, F., Tutte, W.T.: On the dimension of a graph. Mathematika 12, 118-122 (1965)
8. Hendrickson, B.: Conditions For Unique Graph Realizations. SIAM J. Comput. 21(1), 65-84 (1992)
9. Horvat, B., Pisanski, T.: Unit distance representations of the Petersen graph in the plane. Ars Combin. (to appear)
10. Žitnik, A., Horvat, B., Pisanski, T.: All generalized Petersen graphs are unitdistance graphs (submitted)
11. Lovász, L.: Self-dual polytopes and the chromatic number of distance graphs on the sphere. Acta Sci. Math. (Szeged) 45(1-4), 317-323 (1983)
12. Maehara, H.: On the Euclidean dimension of a complete multipartite graph. Discrete Math. 72, 285-289 (1988)
13. Maehara, H.: Note on Induced Subgraphs of the Unit Distance Graph. Discrete Comput. Geom. 4, 15-18 (1989)
14. Maehara, H., Rödl, V.: On the Dimension to Represent a Graph by a Unit Distance Graph. Graphs Combin. 6, 365-367 (1990)
15. Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals, part I: Introduction. Preliminaries. The geometry of semialgebraic sets. The decision problem for the exitential theory of the reals. J. Symb. Comput. 13, 255-300 (1992)
16. Soifer, A.: The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators. Springer, Heidelberg (2008)