A new proof of Vassiliev's conjecture

2013/06/24 by Nikonov, Igor
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1306.5521

Abstract

We give a new proof of Vassiliev's planarity criterion for framed four-valent graphs (and more generally, *-graphs), which is based on Pontryagin-Kuratowski theorem.

Related

• A generalization of Vassiliev's planarity criterion
• Framed 4-valent Graph Minor Theory II: Special Minors and New Examples
• Framed 4-valent Graph Minor Theory I: Intoduction. A Planarity Criterion and Linkless Embeddability
• To Prove Four Color Theorem
• A Planarity Criterion for Graphs