Rotation r-graphs

DOI10.1016/J.DISC.2023.113457MaRDI QIDQ6434241zbMATH OpenOpenAlexFDO

Authors Eckhard Steffen, Isaak H. Wolf

Publication date 25 April 2023

Full work available at URL https://doi.org/10.1016/j.disc.2023.113457

Mathematics Subject Classification ID

Flows in graphs (05C21) Graph theory (05C99)

Abstract: We study rotation $r$-graphs and show that for every $r$-graph $G$ of odd regularity there is a simple rotation $r$-graph $G^{\prime }$ such that $G$ can be obtained form $G^{\prime }$ by a finite number of $2$-cut reductions. As a consequence, some hard conjectures as the (generalized) Berge-Fulkerson Conjecture and Tutte's 3- and 5-flow conjecture can be reduced to rotation $r$-graphs.

Recommendations

• Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction
• Unions of perfect matchings in \(r\)-graphs
• Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks
• Almost all 5-regular graphs have a 3-flow
• Rotation numbers for unions of circuits

This page was built for publication: Rotation $r$-graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6434241)