An independent set $I$ of a graph $G$ is a subset of vertices of $G$ where any two members $u,v\in I$, there is no edge of $G$ connecting $u$ and $v$. The reconfiguration graph of independent sets of $G$ under Token Sliding, denoted by $𝖳𝖲(G)$, takes all independent sets of $G$ as its nodes (vertices). Two nodes $I,J$ of $𝖳𝖲(G)$ are adjacent if there are two vertices $u,v$ such that $I\setminus J=\{u\}$, $J\setminus I=\{v\}$, and $uv$ is an edge of $G$.

• •

  The first line of the file contains the number of graphs, followed by a blank line.

• •

  For each graph $H$, if $H=𝖳𝖲(G)$ is nonplanar for some graph $G$, we provide data on a Kuratowski subgraph of $H$, not the whole graph $H$.

• •

  For each graph:

  • –

    The first line contains the number of vertices $n$.

  • –

    Each of the next $n$ lines is of the form: vertex: label. The vertex is counted from $0$ to $n-1$. If the graph is planar, the format is vertex: label: x y, where $x$ and $y$ are the coordinates of the vertex in a planar layout of the graph. If the graph is $𝖳𝖲(G)$ for some graph $G$, the label is of the form [v1, v2, ..., vk], which represents a size-$k$ independent set of $G$.

  • –

    The next $n$ lines describe the corresponding adjacency matrix.

  • –

    The description ends by a blank line.