Definition: Subdivision of a Graph
Any undirected graph \(H\) formed from another undirected graph \(G\) by inserting vertices of degree \(2\) into the edges of \(G\) is called a subdivision of \(G\).
![subdivision](https://github.com/bookofproofs/bookofproofs.github.io/blob/main/_sources/_assets/images/examples/subdivision.png?raw=true)
(c) bookofproofs
Table of Contents
Corollaries: 1
Mentioned in:
Corollaries: 1
Proofs: 2
Theorems: 3
Thank you to the contributors under CC BY-SA 4.0!
![](https://github.com/bookofproofs/bookofproofs.github.io/blob/main/_sources/_assets/images/calendar-black.png?raw=true)
- Github:
-
![bookofproofs](https://github.com/bookofproofs.png?size=32)
References
Bibliography
- Aldous Joan M., Wilson Robin J.: "Graphs and Applications - An Introductory Approach", Springer, 2000