Planar graphs; geometric and topological aspects of graph theory [See also 57K10, 57M15]
4 mapped entries · Browse and filter all →
Counts include all statuses and descendants. Classifications are editorial or inferred from community fields, not an AMS assessment of the problem.
Conway thrackle constant: determine C 78 or improve its bounds; the repository records 1 (lower) and 1.393 (upper).
Maximum Chromatic Number of Biplanar Graphs: determine C 27b or improve its bounds; the repository records 9 (lower) and 12 (upper).
Conway's Thrackle Conjecture. Solid result problem from Epoch AI’s FrontierMath: Open Problems; answers are checked by a verifier program.
The Earth–Moon Problem. Moderately interesting problem from Epoch AI’s FrontierMath: Open Problems; answers are checked by a verifier program.
These are selected sources for the parent class. Article coverage is a first reviewed selection, and may not cover this exact subcategory.
Electronic Journal of Combinatorics
Combinatorics and graph theory
Journal discovery is available; article-level extraction for this class is not yet included in this batch.
View source evidence →MSC2020 © Mathematical Reviews (AMS) and zbMATH · CC BY-NC-SA 4.0 · Official PDF, page 12