Skip to search formSkip to main contentSkip to account menu

Harborth's conjecture

In mathematics, Harborth's conjecture states that every planar graph has a planar drawing in which all edge lengths are integers. This conjecture is… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Apollonian networkDegeneracy (graph theory)Fáry's theoremGraph drawing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2002
2002
A remarkable eight-point planar configuration
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)