TUYMAADA 2016 S8
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.
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.