Просмотр кода страницы Edge t-ranking

'''Edge <math>t</math>-ranking''' --- реберное <math>t</math>-ранжирование. 

Let <math>G = (V,E)</math> be a graph and <math>t</math> be  a  positive  integer.  An  '''edge <math>t</math>-ranking''' is an edge coloring <math>c':  \; E \rightarrow \{1, \ldots, t\}</math>
such that for every pair of edges <math>e</math> and <math>f</math>  with  <math>c'(e)  =  c'(f)</math>,
there is  an  edge <math>g</math> on every path between <math>e</math> and <math>f</math> with <math>c'(g) >
c'(e)</math>. The '''edge ranking number''', <math>\chi'_{r}(G)</math>, is the smallest
value of <math>t</math> such that <math>G</math> has an edge <math>t</math>-ranking.
==See also==
*''[[Vertex t-ranking]]''.