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.
Cosmic liaisons are established among the nine planets of the solar system. Rockets can only travel along the following routes:Can a traveler get from Earth to Mars?
Five cities \(P,Q,R,S,T\) are connected by different modes of transport as follows
\(P\) and \(Q\) connected by boat as well as rail.
\(S\) and \(R\) connected by bus and boat.
\(Q\) and \(T\) connected by air only.
\(P\) and \(R\) connected by boat only.
\(T\) and \(R\) connected by rail and bus.
If a person visits each of the places starting from \(P\) and gets back to \(P,\) which of the following places must he visit twice?
What is the least number of colors needed to color each vertex of the graph below such that no two adjacent vertices have the same color?
Notes and assumptions
Which of the shapes above cannot be traced without lifting up your pencil and without tracing over the same edge twice?