Table of Contents
Fetching ...
Paper

Edge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor

Abstract

An -regular graph is an -graph, if every odd set of vertices is connected to its complement by at least edges. We prove for , every projective planar -graph with no Petersen-minor is -edge colorable.