Edge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor
Year: 2026
Type: article
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 \in \{4,5\}$, every projective planar $r$-graph with no Petersen-minor is $r$-edge colorable.
Authors: Arnott Kidner, Eckhard Steffen, Weiqiang Yu
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $4,150
Awards: 图的顶点和边划分问题研究, G6781371268
OpenAlex ID: W4417467488
FWCI:
Cites:
Cited by:
Related to: