Mathematics Homework Help. Harvard University Graph Theory Question
Please find attached. Suppose a connected graph G has degree sequence (3, 3, 2, 2, 1, 1, 1, 1).
Does such a graph contain a cycle? Are all graphs with this degree sequence planar? Explain each of
your answers.
Is it possible that two non-isomorphic graphs both have the same above degree sequence?
