Parity constrained strongly connected orientations
Statement
Find a good characterization for undirected graphs having a strongly connected (more generally k-edge-connected) orientation so that the in-degree of every node is odd.
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.