2000 character limit reached
Edge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor
Published 16 Dec 2025 in math.CO | (2512.14285v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper.