A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Minimal graphs with respect to geometric distance realizability
2018
Discussiones Mathematicae Graph Theory
Preserved Fulltext
A graph G is minimal non-unit-distance graph if there is no drawing of G in Euclidean plane having all edges of unit length, but, for each edge e of G, G − e has such a drawing. We prove that, for infinitely many n, the number of non-isomorphic n-vertex minimal non-unit-distance graphs is at least exponential in n.
doi:10.7151/dmgt.2176
fatcat:nxtgrw57ibf27osuepb5sszwey