Discrete Mathematics and its Applications (8th Edition)
2021/05/21 - Planar Graph
10 Graphs
10.7 Planar Graph
10.7.3 Kuratowski’s Theorem
A graph is nonplanar if and only if it contains a subgraph homeomorphic to K 3 , 3 K_{3,3} K3,3 or K 5 K_5 K5.
11 Trees
11.1 Introduction to Trees
A tree is a connected undirected graph with no simple circuits.
An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.
A rooted tree is a tree in which one vertex has been designated as the root and every edge is directed away from the root.
ALL RIGHTS RESERVED © 2021 Teddy van Jerry
This blog is licensed under the CC 4.0 Licence.
See also
Teddy van Jerry’s Personal Homepage
Teddy van Jerry’s CSDN Homepage
Teddy van Jerry’s GitHub Homepage