On rational approximation of a geometric graph

DOI10.1016/j.disc.2013.06.018zbMath1281.05053OpenAlexW2121416354MaRDI QIDQ390273

Vladimir I. Benediktovich

Publication date: 23 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.06.018

zbMATH Keywords

\(k\)-treegeometric grapheverywhere dense set

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Cubic and quartic Diophantine equations (11D25) Graph representations (geometric and intersection representations, etc.) (05C62) Density (toughness, etc.) (05C42)

Cites Work

• Encounter at far point
• There are integral heptagons, no three points on a line, no four on a circle
• Rational Quadrilaterals
• Straight line embeddings of cubic planar graphs with integer edge lengths
• Points at rational distance from the vertices of a triangle
• Integral distances
• Plane integral drawings of planar graphs
• Unnamed Item

This page was built for publication: On rational approximation of a geometric graph