| http://www.w3.org/ns/prov#value | - Please note that to follow the condition that was just mentioned, then the first node in the path must always be a column - This means that at least one of the (at most 2) odd vertices must be a column.Some details: If there is only one odd-degree vertex, then there is no problem, there is an Eulerian cycle between all other nodes.
|
