The Geometric Thickness of Low-Degree Graphs: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 15:0915:09, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,347 bytes +1,347‎ Created page with "Title: The Geometric Thickness of Low-Degree Graphs Research Question: Can the geometric thickness of a graph be bounded as a function of its degree? Methodology: The researchers used graph theory, planar embeddings, and algorithms to investigate the geometric thickness of graphs with a maximum degree of three and four. Results: The authors proved that the geometric thickness of graphs with a maximum degree of three is two. They also presented efficient algorithms for..."
Retrieved from "https://simplesci.org/wiki/The_Geometric_Thickness_of_Low-Degree_Graphs"