Forbidden Subgraphs of the Odd‐Distance Graph
Copyright policy )Forbidden Subgraphs of the Odd‐Distance Graph
AbstractIn [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 .
- University of Washington United States
- VNU University of Science Viet Nam
- University of Mary United States
- Vietnam National University, Hanoi Viet Nam
geometric graphs, Packing and covering in \(n\) dimensions (aspects of discrete geometry), Tilings in \(2\) dimensions (aspects of discrete geometry), Planar graphs; geometric and topological aspects of graph theory, forbidden subgraphs
geometric graphs, Packing and covering in \(n\) dimensions (aspects of discrete geometry), Tilings in \(2\) dimensions (aspects of discrete geometry), Planar graphs; geometric and topological aspects of graph theory, forbidden subgraphs
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).3 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!