Bound graph polysemy. Tanenbaum, Paul J. (2000) The Electronic Journal of Combinatorics [electronic only]
Bounded-degree graphs can have arbitrarily large slope numbers. Pach, János, Pálvölgyi, Dömötör (2006) The Electronic Journal of Combinatorics [electronic only]
Bounded-degree graphs have arbitrarily large geometric thickness. Barát, János, Matoušek, Jirí, Wood, David R. (2006) The Electronic Journal of Combinatorics [electronic only]