[1]
Engel, K. and Hanisch, S. 2018. Bandwidth of Graphs Resulting from the Edge Clique Covering Problem. The Electronic Journal of Combinatorics. 25, 4 (Dec. 2018), P4.49. DOI:https://doi.org/10.37236/6900.