О планарных графах без предписанной $3$-раскраски

We construct a planar graph without $4$-and $5$-cycles and without intersecting triangles that has $366$ vertices and no list $3$-coloring from a set of $4$ colors.