Two counterexamples on completely independent spanning trees

For each k ≥ 2 , we construct a k -connected graph which does not contain two completely independent spanning trees. This disproves a conjecture of Hasunuma. Furthermore, we also give an example of a 3-connected maximal plane graph not containing two completely independent spanning trees.