discrete maths

set of edges joined end to end

2 graphs that have the same structure are:

subdivisions create __ extra vertex and edge

what subgraphs subdivision disproves planarity? ___ and K3,3

what subgraphs subdivision disproves planarity? K5 and ____

if a graph contains a subgraph of a SUBDIVISION of K5 or K3,3, it is ________

complete graphs with n vertices denoted by

v + f = e + _

v + f = _ + 2

_ + f = e + 2