Talk:Skew-symmetric graph
 | This article is rated B-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Unclear sentence
editThe undirected edges at each vertex of the polar graph may be partitioned into two subsets according to which vertex of the polar graph they go out of and come into.
But the polar graph has undirected edges... Where from go out undirected edge and where it come into? Jumpow (talk) 20:33, 12 March 2019 (UTC)
Section Still life theory: all edges belong to a single partition
What patition? No one word about any partition in this section. Jumpow (talk) 15:21, 13 March 2019 (UTC)
Given additionally a non-negative length function on the edges of the graph that assigns the same length to any edge e and to σ(e), the shortest regular path connecting a given pair of nodes in a skew-symmetric graph with m edges and n vertices may be tested in time O(m log n).
May be tested ... what? Existance (of what)? Jumpow (talk) 15:55, 13 March 2019 (UTC)