You must be logged in to see worked solutions.

Already have an account? Log in here.

Any connected group of things can be represented as a graph: cities and roads, people and friendships, and more. Learn why an even number of people have an odd number of friends.

Is this graph planar?

You must be logged in to see worked solutions.

Already have an account? Log in here.

Is this graph planar?

You must be logged in to see worked solutions.

Already have an account? Log in here.

You must be logged in to see worked solutions.

Already have an account? Log in here.

Suppose that there are three houses \(A, B, C\) and three utilities 1, 2, and 3 each of which needs to be connected by a wire to all three houses. Assuming the utilities and the houses are all points (nodes), is there a way to position them and the wires (edges) such that no two wires overlap?

Note: this is the same as asking whether \(K_{3,3}\) is a planar graph.

You must be logged in to see worked solutions.

Already have an account? Log in here.

You must be logged in to see worked solutions.

Already have an account? Log in here.

×

Problem Loading...

Note Loading...

Set Loading...