Definition: Face Degree

Let $G$ be a biconnected planar graph with a given planar drawing and let $f$ be any face in the drawing. Then, the degree of $f$ (denoted by $\deg f$) is the number of edges in a cycle around the boundary of $f.$

Notes

Explanations: 1
Proofs: 2 3 4


Thank you to the contributors under CC BY-SA 4.0!

Github:
bookofproofs


References

Bibliography

  1. Aldous Joan M., Wilson Robin J.: "Graphs and Applications - An Introductory Approach", Springer, 2000