ear decompositions of maximal planar graphs, called canonical orderings, are also a standard tool in graph drawing.

Strong connectivity of directed graphs

The above definitions can also be applied to directed graphs. An ear is then a directed path where all internal vertices have indegree and outdegree equal to 1. A directed graph is strongly connected

1.Previous
3.Next