bipboxicity2011

https://www.doi.org/10.1007/S00373-011-1017-2

@article{bipboxicity2011,
author = {L. Sunil Chandran and Mathew C. Francis and Rogers Mathew},
doi = {10.1007/S00373-011-1017-2},
journaltitle = {Graphs Comb.},
number = {3},
pages = {353--362},
title = {Chordal Bipartite Graphs with High Boxicity},
volume = {27},
year = {2011},
}

page 9 : bounded distance to bipartite does not imply bounded boxicity – Theorem 2 For any $b \in \mathbb N^+$, there exists a chordal bipartite graph $G$ (ed: i.e. bipartite graph with no induced cycle on more than 4 vertices) with $\mathrm{box}(G) > b$.