The Characterization of planar, 4-connected, K2,5-minor-free graphs
Abstract
We show that every planar, 4-connected, K2;5-minor- free graph is the square of a cycle of even length at least six.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.