The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Conflict-free graph orientations with parity constraints
[article]
2012
arXiv
pre-print
It is known that every multigraph with an even number of edges has an even orientation (i.e., all indegrees are even). We study parity constrained graph orientations under additional constraints. We consider two types of constraints for a multigraph G=(V,E): (1) an exact conflict constraint is an edge set C in E and a vertex v in V such that C should not equal the set of incoming edges at v; (2) a subset conflict constraint is an edge set C in E and a vertex v in V such that C should not be a
arXiv:1203.3256v2
fatcat:6pfhqqutxfgp3evxthiplkcr3q