◀ ▲ ▶Branches / Graph-theory / Definition: Subdivision of a Graph

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\).

(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!

Github:

References

Bibliography

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