Wheel Graphs with Integer Edges

Harborth's conjecture states that the edges of any planar graph can all have integer length. Planar graphs with non-triangular faces can have edges added to get a maximal planar (or triangulated) graph, where all faces are triangles. A solution for a given maximal planar graph would contain many integer wheel graphs. This Demonstration shows many integer wheel graphs found with searchs. Triangles are colored by their area radicals.

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

DETAILS

Examining the hexagon possibilities took weeks, despite excluding many types of symmetries. A fast method to collect allowable heptagons, octagons, and general -gons with a given maximal edge length is currently unknown to the author.
References
[1] Wikipedia. "Harborth's Conjecture." (Mar 1, 2015) en.wikipedia.org/wiki/Harborth's_conjecture.
[2] Wikipedia. "Planar Graph." (Mar 1, 2015) en.wikipedia.org/wiki/Planar_graph# Maximal_planar _graphs.
[3] Wikipedia. "Robbins Pentagon." (Mar 1, 2015) en.wikipedia.org/wiki/Robbins_pentagon.
[4] Wikipedia. "Wheel Graph." (Mar 1, 2015) en.wikipedia.org/wiki/Wheel_graph.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.