Papers
Topics
Authors
Recent
Search
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 rr-regular graph is an rr-graph, if every odd set of vertices is connected to its complement by at least rr edges. We prove for r∈4,5r \in {4,5}, every projective planar rr-graph with no Petersen-minor is rr-edge colorable.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 2 tweets with 4 likes about this paper.