Year: 2017
Type: preprint
Abstract: Let $G$ be a graph, let $k$ be a positive integer, and let $p:V(G)\rightarrow Z_k$ be a mapping with $|E(G)| \stackrel{k}{\equiv}\sum_{v\in V(G)}p(v) $. In this paper, we show that if $G$ is $(3k-3)$-edge-connected, then it has an orientation such that for each vertex $v$, $|d^+_G(v)-d_G(v)/2| < k$; also if $G$ contains $2k-2$ edge-disjoint spanning trees, then it admits such an orientation but by imposing greater out-degree bounds.
Source: arXiv (Cornell University)
Author: Hasanvand, Morteza
Institution: Sharif University of Technology
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4301042201