AbstractThis paper investigates the problem of embedding a graph into a tree with the same vertex set (a spanning tree in particular), such that the maximum congestion of the edges is minimized. We calculate exact formulas for the tree congestion and spanning tree congestion for various families of graphs, including grids and complete bipartite graphs
Spanning tree congestion is a relatively new graph parameter, which has been studied intensively. Th...
AbstractWe study the embedding problem of enhanced and augmented hypercubes into complete binary tre...
this paper we study a combinatorial congestion problem. We de ne a congestion problem as an allocat...
AbstractThis paper investigates the problem of embedding a graph into a tree with the same vertex se...
AbstractLet G be a connected graph and T be a spanning tree of G. For e∈E(T), the congestion of e is...
We prove that every connected graph G of order n has a spanning tree T such that for every edge e of...
AbstractLet G be a graph and let T be a tree with the same vertex set. Let e be an edge of T and Ae ...
In the spanning tree congestion problem, given a connected graph $G$, the objective is to compute a ...
AbstractWe prove that every connected graph G of order n has a spanning tree T such that for every e...
AbstractLet G be a finite connected graph and T be a spanning tree. For any edge e of T, let Ae,Be b...
AbstractThe main purpose of the paper is to develop an approach to the evaluation or the estimation ...
Let G be a connected graph and T be a spanning tree of G. For e ∈ E(T), the congestion of e is the n...
Spanning tree congestion was defined by Ostrovskii (2004) as a measure of how well a network can per...
We study the problem of determining the spanning tree congestion of a graph. We present some sharp c...
We study the problem of determining the spanning tree congestion of a graph. We present some sharp c...
Spanning tree congestion is a relatively new graph parameter, which has been studied intensively. Th...
AbstractWe study the embedding problem of enhanced and augmented hypercubes into complete binary tre...
this paper we study a combinatorial congestion problem. We de ne a congestion problem as an allocat...
AbstractThis paper investigates the problem of embedding a graph into a tree with the same vertex se...
AbstractLet G be a connected graph and T be a spanning tree of G. For e∈E(T), the congestion of e is...
We prove that every connected graph G of order n has a spanning tree T such that for every edge e of...
AbstractLet G be a graph and let T be a tree with the same vertex set. Let e be an edge of T and Ae ...
In the spanning tree congestion problem, given a connected graph $G$, the objective is to compute a ...
AbstractWe prove that every connected graph G of order n has a spanning tree T such that for every e...
AbstractLet G be a finite connected graph and T be a spanning tree. For any edge e of T, let Ae,Be b...
AbstractThe main purpose of the paper is to develop an approach to the evaluation or the estimation ...
Let G be a connected graph and T be a spanning tree of G. For e ∈ E(T), the congestion of e is the n...
Spanning tree congestion was defined by Ostrovskii (2004) as a measure of how well a network can per...
We study the problem of determining the spanning tree congestion of a graph. We present some sharp c...
We study the problem of determining the spanning tree congestion of a graph. We present some sharp c...
Spanning tree congestion is a relatively new graph parameter, which has been studied intensively. Th...
AbstractWe study the embedding problem of enhanced and augmented hypercubes into complete binary tre...
this paper we study a combinatorial congestion problem. We de ne a congestion problem as an allocat...
DOI
Add to ORKG