Schmeichel–Hakimi conjecture on exceptional planar graphical sequences
Schmeichel–Hakimi conjecture on exceptional planar graphical sequences
From papers
A graphical sequence is planar graphical if it is the degree sequence of a planar graph. Using the shorthand for repetitions of followed by repetitions of , consider the sequences , , and . Schmeichel–Hakimi conjecture. None of these three sequences is planar graphical. The source states that these are the three unresolved cases remaining after their theorem, so the conjecture is open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Jorik Jooken, “Computer-assisted graph theory: a survey”, arXiv:2508.20825 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.