![](/files/happy5.png)
cut-continuous mapping
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.
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
Keywords: Clebsch graph; cut-continuous mapping; edge-coloring; homomorphism; pentagon
![Syndicate content Syndicate content](/misc/feed.png)