AbstractAn edge ordering of a graph G=(V,E) is an injection f:E→N. 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
Let $\lambda(G)$ denote the smallest number of vertices that can be removed from a non-empty graph $...
A path π = (v1, v2,...vk+1) in a graph G = (V,E) is a downhill path if for every i, 1 \u3c i \u3c k,...
Let λ(G) denote the smallest number of vertices that can be removed from a non-empty graph G so tha...
AbstractAn edge ordering of a graph G=(V,E) is an injection f:E→N. A (simple) path for which f incre...
AbstractAn edge ordering of a graph G=(V,E) is an injection f:E→Q+ where Q+ is the set of positive r...
AbstractAn edge ordering of a graph G=(V,E) is an injection f:E→Q+ where Q+ is the set of positive r...
An edge ordering of a graph G is an injection f : E(G) → R, the set of real numbers. A path in G for...
AbstractAn edge-ordering of a graph G=(V,E) is a one-to-one function f from E to a subset of the set...
AbstractAn edge-ordering of a graph G=(V,E) is a one-to-one function f from E to a subset of the set...
AbstractAn edge-ordered graph is an ordered pair (G,f), where G=G(V,E) is a graph and f is a bijecti...
The mean subtree order of a given graph $G$, denoted $\mu(G)$, is the average number of vertices in ...
We introduce and study a new containment relation in graphs – lift contractions. H is a lift contrac...
AbstractAn L(j,k)-labeling of a graph G, where j≥k, is defined as a function f:V(G)→Z+∪{0} such that...
A path π = (v1, v2, . . . , vk+1) iun a graph G = (V, E) is a downhill path if for every i, 1 ≤ i ≤ ...
How long a monotone path can one always find in any edge-ordering of the complete graph Kn? This app...
Let $\lambda(G)$ denote the smallest number of vertices that can be removed from a non-empty graph $...
A path π = (v1, v2,...vk+1) in a graph G = (V,E) is a downhill path if for every i, 1 \u3c i \u3c k,...
Let λ(G) denote the smallest number of vertices that can be removed from a non-empty graph G so tha...
AbstractAn edge ordering of a graph G=(V,E) is an injection f:E→N. A (simple) path for which f incre...
AbstractAn edge ordering of a graph G=(V,E) is an injection f:E→Q+ where Q+ is the set of positive r...
AbstractAn edge ordering of a graph G=(V,E) is an injection f:E→Q+ where Q+ is the set of positive r...
An edge ordering of a graph G is an injection f : E(G) → R, the set of real numbers. A path in G for...
AbstractAn edge-ordering of a graph G=(V,E) is a one-to-one function f from E to a subset of the set...
AbstractAn edge-ordering of a graph G=(V,E) is a one-to-one function f from E to a subset of the set...
AbstractAn edge-ordered graph is an ordered pair (G,f), where G=G(V,E) is a graph and f is a bijecti...
The mean subtree order of a given graph $G$, denoted $\mu(G)$, is the average number of vertices in ...
We introduce and study a new containment relation in graphs – lift contractions. H is a lift contrac...
AbstractAn L(j,k)-labeling of a graph G, where j≥k, is defined as a function f:V(G)→Z+∪{0} such that...
A path π = (v1, v2, . . . , vk+1) iun a graph G = (V, E) is a downhill path if for every i, 1 ≤ i ≤ ...
How long a monotone path can one always find in any edge-ordering of the complete graph Kn? This app...
Let $\lambda(G)$ denote the smallest number of vertices that can be removed from a non-empty graph $...
A path π = (v1, v2,...vk+1) in a graph G = (V,E) is a downhill path if for every i, 1 \u3c i \u3c k,...
Let λ(G) denote the smallest number of vertices that can be removed from a non-empty graph G so tha...
DOI
Add to ORKG