3 problems

For a positive integer $k$, let $B_k$ denote the class of edge intersection graphs of paths on a grid in which each path has at most $k$ bends, and let $B_k^m$ denote the subclass…

For a positive integer $k$, let $B_k$ denote the class of edge intersection graphs of paths on a grid in which each path has at most $k$ bends, and let $B_k^m$ denote the subclass…

A $B_1$-EPG graph is the edge-intersection graph of paths in a rectangular grid, with each path having at most one bend. A graph is 3-clique colorable if its vertices can be colore…