Every graph is an integral distance graph in the plane

DOI10.1006/jcta.1997.2826zbMath0884.05037OpenAlexW1975153673MaRDI QIDQ1374191

Hiroshi Maehara, Katsuhiro Ota, Norihide Tokushige

Publication date: 12 March 1998

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1f5c0cbeb97453ab39347506b0c126367a5d72a4

zbMATH Keywords

euclidean planeintegral distance graph oscillators

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Elementary problems in Euclidean geometries (51M04)

Related Items (4)

The odd-distance plane graph ⋮ Odd wheels are not odd-distance graphs ⋮ Note on integral distances ⋮ Every 3-colorable graph has a faithful representation in the odd-distance graph

Cites Work

• Problems, problems, problems
• Are There n + 2 Points in E n With Odd Integral Distances?
• Integral distances
• Integral distances
• Unnamed Item

This page was built for publication: Every graph is an integral distance graph in the plane