Acyclic orientation with parity constraints
Statement
Problem 1. Find a good characterization for undirected graphs having an acyclic orientation so that the in-degree of every node is even. Problem 2. Find a good characterization for undirected graphs and , having an acyclic orientation so that the in-degree of a node is odd iff it is in Problem 3. Find a good characterization for undirected graphs which, for every possible satisfying even, have an acyclic orientation so that the in-degree of a node is odd iff it is in
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.