SEARCH

SEARCH BY CITATION

Keywords:

  • geometric graphs;
  • forbidden subgraphs

Abstract

In [2], on page 252 the following logical terminal inexactitude was made: “...the existence of a K4 is the only obstruction. That is, every finite K4-free graph can be represented by odd-distances in the plane.” In this note we correct this erroneous claim by showing that W5, the 5-wheel, see Figure 1, is not a subgraph of inline image.