A program for proving that a given graph is not a unit-distance graph: preliminary report

Abstract

This paper describes a program for proving that a given graph is not a unit distance graph. The algorithm described is not quite brute force.

DOI: 10.1145/1185448.1185627

Cite this paper

@inproceedings{Hochberg2006APF, title={A program for proving that a given graph is not a unit-distance graph: preliminary report}, author={Robert Hochberg}, booktitle={ACM Southeast Regional Conference}, year={2006} }