Edge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918249868820480 |
|---|---|
| author | Kidner, Arnott Steffen, Eckhard Yu, Weiqiang |
| author_facet | Kidner, Arnott Steffen, Eckhard Yu, Weiqiang |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_14285 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Edge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor Kidner, Arnott Steffen, Eckhard Yu, Weiqiang Combinatorics 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. |
| title | Edge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2512.14285 |