St-planar graph
In graph theory, an st-planar graph is a bipolar orientation of a plane graph for which both the source and the sink of the orientation are on the outer face of the graph. That is, it is a directed graph drawn without crossings in the plane, in such a way that there are no directed cycles in the graph, exactly one graph vertex has no incoming edges, exactly one graph vertex has no outgoing edges, and these two special vertices both lie on the outer face of the graph.
primaryTopic
St-planar graph
In graph theory, an st-planar graph is a bipolar orientation of a plane graph for which both the source and the sink of the orientation are on the outer face of the graph. That is, it is a directed graph drawn without crossings in the plane, in such a way that there are no directed cycles in the graph, exactly one graph vertex has no incoming edges, exactly one graph vertex has no outgoing edges, and these two special vertices both lie on the outer face of the graph.
has abstract
In graph theory, an st-planar ...... an extra edge in the same way.
@en
Wikipage page ID
47,704,642
Wikipage revision ID
729,817,949
subject
hypernym
comment
In graph theory, an st-planar ...... n the outer face of the graph.
@en
label
St-planar graph
@en