Premium
Forbidden Subgraphs of the Odd‐Distance Graph
Author(s) -
Rosenfeld Moshe,
Tiến Nam Lê
Publication year - 2014
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.21738
Subject(s) - combinatorics , mathematics , graph , plane (geometry) , distance hereditary graph , graph factorization , planar graph , discrete mathematics , line graph , graph power , geometry
In [2], on page 252 the following logical terminal inexactitude was made: “... the existence of a K 4 is the only obstruction. That is, every finite K 4 ‐free graph can be represented by odd‐distances in the plane .” In this note we correct this erroneous claim by showing that W 5 , the 5‐wheel, see Figure 1, is not a subgraph of G o d d .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom