Graph problem
Source: tuymaada 2016. seniors P8
July 22, 2016
combinatoricsgraph theory
Problem Statement
A connected graph is given. Prove that its vertices can be coloured
blue and green and some of its edges marked so that every two vertices
are connected by a path of marked edges, every marked edge connects
two vertices of different colour and no two green vertices are connected
by an edge of the original graph.