Symbol-crunching the Harborth graph

DOI10.1016/J.AAM.2010.09.003zbMATH Open1218.05106OpenAlexW1993610760MaRDI QIDQ550261FDOQ550261

Eberhard H.-A. Gerbracht

Publication date: 8 July 2011

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2010.09.003

Recommendations

• A lower bound for \(4\)-regular planar unit distance graphs
• scientific article; zbMATH DE number 6881053
• 4-regular planar unit triangle graphs without additional triangles
• Small unit-distance graphs in the plane
• scientific article; zbMATH DE number 3896969

zbMATH Keywords

computer algebradynamical geometry softwareHarborth graphmatchstick graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• A tight bound for the number of edges of matchstick graphs

Uses Software

• GeoGebra

This page was built for publication: Symbol-crunching the Harborth graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q550261)