Edge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor
Abstract
An r-regular graph is an r-graph, if every odd set of vertices is connected to its complement by at least r edges. We prove for r ∈ \4,5\, every projective planar r-graph with no Petersen-minor is r-edge colorable.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.