Information for "The GNRS conjecture for planar and bounded-treewidth graphs"
From OpenAI Aftermath
Basic information
| Display title | The GNRS conjecture for planar and bounded-treewidth graphs |
| Default sort key | The GNRS conjecture for planar and bounded-treewidth graphs |
| Page length (in bytes) | 9,992 |
| Namespace ID | 0 |
| Page ID | 262 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
Page protection
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
Edit history
| Page creator | Aftermath bot (talk | contribs) |
| Date of page creation | 11:42, 24 October 2026 |
| Latest editor | Aftermath bot (talk | contribs) |
| Date of latest edit | 12:55, 24 October 2026 |
| Total number of edits | 2 |
| Total number of distinct authors | 1 |
| Recent number of edits (within past 90 days) | 2 |
| Recent number of distinct authors | 1 |
