Talk:Polyhedral graph

Missing word?
More strongly, there exists a constant &alpha; &lt; 1 (the shortness exponent) and an infinite family of polyhedral graphs such that the length of the longest simple path of an n-vertex graph in the family is O(n&alpha;).

Isn't the word "cubic" missing in that sentence? --MathsPoetry (talk) 08:48, 14 February 2013 (UTC)
 * I think you could define a shortness exponent for cubic polyhedral graphs, and for polyhedral graphs more generally, but it might not be the same exponent. —David Eppstein (talk) 15:28, 14 February 2013 (UTC)
 * Then the word is not missing.
 * As you have understood it, the previous order of sentences was misleading with respect to current hypotheses. Great that you have changed it. --MathsPoetry (talk) 20:50, 14 February 2013 (UTC)