Просмотр кода страницы Simply sequential numbering

'''Simply sequential numbering''' --- простая последовательная
нумерация. 

For a graph <math>G</math> with <math>p</math> vertices and <math>q</math> edges, a labeling is a ''' simply sequential numbering'''
if each of the numbers <math>1,2, \ldots, p+q</math> is either a vertex
label or an induced edge label.

If  <math>h</math> is the smallest vertex label in a ''' simply sequential numbering''' (and so the numbers
<math>1,2, \ldots, h-1</math> are induced edge labels, if <math>h < 1</math>), then <math>h</math> is
called the ''' height''' of the ''' simply sequential numbering'''.