Characterise word-representable near-triangulations containing the complete graph K4 (such a characterisation is known for K4-free planar…

Characterise word-representable near-triangulations containing the complete graph K4 (such a characterisation is known for K4-free planar graphs)

Open the “Word-representation of graphs” section on Wikipedia →

Source: List of unsolved problems in mathematics (CC BY-SA 4.0)