This research was funded in part by a grant from the Vietnam Education Foundation (VEF). The opinions, findings, and conclusions stated herein are those of the authors and do not necessarily reflect those of VEF.
Forbidden Subgraphs of the Odd-Distance Graph
Article first published online: 10 APR 2013
© 2013 Wiley Periodicals, Inc.
Journal of Graph Theory
Volume 75, Issue 4, pages 323–330, April 2014
How to Cite
Rosenfeld, M. and Tiến, N. L. (2014), Forbidden Subgraphs of the Odd-Distance Graph. J. Graph Theory, 75: 323–330. doi: 10.1002/jgt.21738
- Issue published online: 15 JAN 2014
- Article first published online: 10 APR 2013
- Manuscript Revised: 1 FEB 2013
- Manuscript Received: 17 APR 2012
- Vietnam Education Foundation (VEF)
- geometric graphs;
- forbidden subgraphs
In , 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 .