Unformatted text preview: pay. 5' (ﬁrst; 1. loot} 32 Kuratowski s Theorem is related to planar graphs
State Kuratoweki s Theorem — 33. Copy and complete: “Let G be a loopless labelled graph with adjacency matrix A and
degree matrix D. Then all cofactors of ” M m 44 (7'? 34. Copy and complete Brooks’ Theorem. “If G be a simple connected graph with largest
vertexedegree A, then m” — 35. Copy and complete Vizing’s Theorem. “If G be a simple graph with largest vertex—degree
A, then H.” 36 Suppose that G is a simple connected plane graph with o e edges and f faces.
If each face of G' is a 3-»cyc1e Show that e -- 31: ~— — ...
View Full Document
- One '14
- Graph Theory