1 problem

The $(2k-1)$ -edge-connected bounded-out-degree orientation conjecture
Let $G$ be a graph, let $k$ be an integer with $k\ge 3$ , and let $p:V(G)\rightarrow Z_k$ satisfy … A $p$ -orientation is an orientation satisfying the prescribed modulo- $k$ out-degr…
openFrom papersedge-connectivity graph-orientations out-degree-bounds
0 responses
8

The (2k−1)(2k-1)(2k−1)-edge-connected bounded-out-degree orientation conjecture