Erdős Problem #842 — Three-colouring triangles joined by a Hamiltonian cycle
Take vertex-disjoint triangles and add a Hamiltonian cycle through their vertices using none of the triangle edges. Is the resulting graph always 3-colourable?
References
Primary source
Additional references
P. Erdős, Some of my favourite problems in various branches of combinatorics, Le Matematiche 47 (1992), no. 2, 231–240.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.