Record number :
Title of article :
Trees with depression three Original Research Article
Author/Authors :
C.M. Mynhardt، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2008
Pages :
From page :
To page :
Abstract :
An edge ordering of a graph image is an injection image. A (simple) path for which f increases along its edge sequence is an f-ascent, and a maximal f-ascent if it is not contained in a longer f-ascent. The depression of G is the least integer k such that every edge ordering of G has a maximal ascent of length at most k. We characterise trees with depression three.
Keywords :
Edge ordering , Increasing path , Depression , Monotone path
Journal title :
Discrete Mathematics
Serial Year :
Link To Document :