All Questions

I am looking for previous work regarding graphs whose vertices can be assigned colours (not necessarily a proper colouring) in such a way that each colour class induces a tree. In particular I am ...

Suppose we have a planar graf with vertices $v_o, \ldots, v_n$, where $n$ is even such that if we checkerboard-color regions in the complement, then the black regions are $n$ (non-degenerated) ...

Let $T$ be a given (finite) tree. Question 1: Is it always possible to add edges to $T$ to obtain a $2$-connected outerplanar supergraph $G$? Question 2: If the answer to Question #1 is negative, can ...