Simple and Direct Proof of MacLane's Planarity Criterion
Alexander Kelmans
Abstract
We give a simple proof of MacLane's algebraic planarity criterion for graphs. This proof does not use any other known planarity criteria. Keywords: graph, planarity, cycle space, a simple basis of a graph.
Create a lesson
Related papers
Maximal anti-Ramsey problems for posets
Binlong Li, Balázs Patkós, Changxin Wang
An Improved Bound for Smith's Longest Cycles Conjecture via a Forbidden Subdivision
Douglas M. Chen
Perfect state transfer on Cayley graphs over dihedral groups: A complete and practical characterization
Shixin Wang
An Improvement to the Upper Bound for Marton's Covering Conjecture
Zhao Song, Song Yue
Vertex-transitive strongly regular graphs in the switching class of doubly transitive two-graphs
Robert F. Bailey, Gábor P. Nagy, Valentino Smaldore
Inversion-descent enumerators of 321-avoiding permutations
Qiongqiong Pan