English

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

Combinatorics 2025-12-17 v1

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,5}r \in \{4,5\}, every projective planar rr-graph with no Petersen-minor is rr-edge colorable.

Keywords

Cite

@article{arxiv.2512.14285,
  title  = {Edge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor},
  author = {Arnott Kidner and Eckhard Steffen and Weiqiang Yu},
  journal= {arXiv preprint arXiv:2512.14285},
  year   = {2025}
}

Comments

20 pages, 10 figures