Forbidden Subgraphs of the Odd-Distance Graph

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...

Full description

Saved in:
Bibliographic Details
Published inJournal of graph theory Vol. 75; no. 4; pp. 323 - 330
Main Authors Rosenfeld, Moshe, Tiến, Nam Lê
Format Journal Article
LanguageEnglish
Published Hoboken Blackwell Publishing Ltd 01.04.2014
Wiley Subscription Services, Inc
Subjects
forbidden subgraphs
geometric graphs
Online AccessGet full text

Cover

More Information
Summary: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 Godd.
Bibliography:Vietnam Education Foundation (VEF)
istex:DCBCC4F6B9CF4B906676843E82B93DF8A86D4811
ArticleID:JGT21738
ark:/67375/WNG-JZ5JTXLZ-L
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.
ISSN:0364-9024
1097-0118
DOI:10.1002/jgt.21738