Lecture
A facet in a flat representation of a graph is a part of a plane bounded by a simple cycle and not containing within other cycles. There is always one unlimited outer edge, all other faces are called internal.
The graph contains 4 faces: 1 outer and 3 inner (A, B, C)
The tree has only one (outer) face
Comments
To leave a comment
Discrete Math. Set theory. Graph theory. Combinatorics.
Terms: Discrete Math. Set theory. Graph theory. Combinatorics.