The detour number of a graph. This is the number of vertices in a longest induced path in a graph. Note that [1] defines the detour number as the number of edges in a longest induced path, which is unsuitable for the empty graph.

The game chromatic number of a graph. Two players, Alice and Bob, take turns colouring properly any uncolored vertex of the graph. Alice begins. If it is not possible for either player to colour a vertex, then Bob wins. If the graph is completely colored, Alice wins. The game chromatic number is the smallest number of colours such that Alice has a winning strategy.

The connected partition number of a graph. This is the maximal number of blocks of a set partition $P$ of the set of vertices of a graph such that contracting each block of $P$ to a single vertex yields a clique. Also called the pseudoachromatic number of a graph. This is the largest $n$ such that there exists a (not necessarily proper) $n$-coloring of the graph so that every two distinct colors are adjacent.

The number of vertices of the largest induced star graph in the graph.

The mutual visibility number of a graph. This is the largest cardinality of a subset $P$ of vertices of a graph $G$, such that for each pair of vertices in $P$ there is a shortest path in $G$ which contains no other point in $P$. In particular, the mutual visibility number of the disjoint union of two graphs is the maximum of their mutual visibility numbers.

The tree-depth of a graph. The tree-depth $\operatorname{td}(G)$ of a graph $G$ whose connected components are $G_1,\ldots,G_p$ is recursively defined as $$\operatorname{td}(G)=\begin{cases} 1, & \text{if }|G|=1\\ 1 + \min_{v\in V} \operatorname{td}(G-v), & \text{if } p=1 \text{ and } |G| > 1\\ \max_{i=1}^p \operatorname{td}(G_i), & \text{otherwise} \end{cases}$$ Nešetřil and Ossona de Mendez [2] proved that the tree-depth of a connected graph is equal to its minimum elimination tree height and its centered chromatic number (fewest colors needed for a vertex coloring where every connected induced subgraph has a color that appears exactly once). Tree-depth is strictly greater than [[St000536|pathwidth]]. A [[St001120|longest path]] in $G$ has at least $\operatorname{td}(G)$ vertices [3].

The bandwidth of a graph. The bandwidth of a graph is the smallest number $k$ such that the vertices of the graph can be ordered as $v_1,\dots,v_n$ with $k \cdot d(v_i,v_j) \geq |i-j|$. We adopt the convention that the singleton graph has bandwidth $0$, consistent with the bandwith of the complete graph on $n$ vertices having bandwidth $n-1$, but in contrast to any path graph on more than one vertex having bandwidth $1$. The bandwidth of a disconnected graph is the maximum of the bandwidths of the connected components.

The dimension of a graph. The dimension of a graph is the least integer $n$ such that there exists a representation of the graph in the Euclidean space of dimension $n$ with all vertices distinct and all edges having unit length. Edges are allowed to intersect, however.

The biclique partition number of a graph. The biclique partition number of a graph is the minimum number of pairwise edge disjoint complete bipartite subgraphs so that each edge belongs to exactly one of them. A theorem of Graham and Pollak [1] asserts that the complete graph $K_n$ has biclique partition number $n - 1$.

The proper pathwidth of a graph. The proper pathwidth $\operatorname{ppw}(G)$ was introduced in [1] as the minimum width of a proper-path-decomposition. Barioli et al. [2] showed that if $G$ has at least one edge, then $\operatorname{ppw}(G)$ is the minimum $k$ for which $G$ is a minor of the Cartesian product $K_k \square P$ of a complete graph on $k$ vertices with a path; and further that $\operatorname{ppw}(G)$ is the minor monotone floor $\lfloor \operatorname{Z} \rfloor(G) := \min\{\operatorname{Z}(H) \mid G \preceq H\}$ of the [[St000482|zero forcing number]] $\operatorname{Z}(G)$. It can be shown [3, Corollary 9.130] that only the spanning supergraphs need to be considered for $H$ in this definition, i.e. $\lfloor \operatorname{Z} \rfloor(G) = \min\{\operatorname{Z}(H) \mid G \le H,\; V(H) = V(G)\}$. The minimum degree $\delta$, treewidth $\operatorname{tw}$, and pathwidth $\operatorname{pw}$ satisfy $$\delta \le \operatorname{tw} \le \operatorname{pw} \le \operatorname{ppw} = \lfloor \operatorname{Z} \rfloor \le \operatorname{pw} + 1.$$ Note that [4] uses a different notion of proper pathwidth, which is equal to bandwidth.