Check these attributes:
One week before his final exam, Arun hit problem 1642. Prove that a connected graph G is a tree if and only if every edge is a bridge. He wrote the proof in his notebook before looking. When he turned the page, his proof was three lines shorter than the book’s. He laughed—a real laugh, the kind that surprises you. 2000 solved problems in discrete mathematics pdf