On graphs which have locally complete 2-edge-colourings and their relationship to proper circular-arc graphs

Jørgen Bang-Jensen, Jing Huang

A 2-edge-coloured graph $G$ is called {\bf locally complete} if for each vertex $v$, the vertices adjacent to $v$ through edges of the same colour induce a complete subgraph in $G$…