
pentagon
Weak pentagon problem ★★
Author(s): Samal
Conjecture If
is a cubic graph not containing a triangle, then it is possible to color the edges of
by five colors, so that the complement of every color class is a bipartite graph.


Keywords: Clebsch graph; cut-continuous mapping; edge-coloring; homomorphism; pentagon
