All Questions

This question concerns a method of drawing graphs and a graph characteristic about which I want to learn more. Consider a connected directed graph with at least one node with in-degree 0 and one node ...

I know that any 3-connected simple planar graph with a designated outside face (outer face) has a primal-dual (double) circle packing (Brightwell-Scheinerman Theorem). Q1- But I am not sure whether ...