Answers are grounded in this paper and cite their sources.
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 ∈ \4,5\, every projective planar r-graph with no Petersen-minor is r-edge colorable.
No takes yet. Share an insight, caveat, or question.
Kidner et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: