AbstractWe prove that every connected graph G of order n has a spanning tree T such that for every edge e of T the edge cut defined in G by the vertex sets of the two components of T−e contains at most n32 edges. This result solves a problem posed by Ostrovskii (M.I. Ostrovskii, Minimal congestion trees, Discrete Math. 285 (2004) 219–226)
Consider a connected graph G and let T be a spanning tree of G. Every edge e∈G−T induces a cycle in ...
In the spanning tree congestion problem, given a connected graph $G$, the objective is to compute a ...
We study the problem of determining the spanning tree congestion of a graph. We present some sharp c...
AbstractWe prove that every connected graph G of order n has a spanning tree T such that for every e...
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 connected graph and T be a spanning tree of G. For e∈E(T), the congestion of e is...
AbstractLet G be a finite connected graph and T be a spanning tree. For any edge e of T, let Ae,Be b...
AbstractThis paper investigates the problem of embedding a graph into a tree with the same vertex se...
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...
Let G=(V,E) be a complete n-vertex graph with distinct positive edge weights. We prove that for k{1,...
AbstractGiven a graph G, for an integer c∈{2,…,|V(G)|}, define λc(G)=min{|X|:X⊆E(G),ω(G−X)≥c}. For a...
Given a weighted graph G = (V;E), a positive integer k, and a penalty fun tion w p, we want to nd k ...
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 ...
AbstractLet G=(V,E) be a complete n-vertex graph with distinct positive edge weights. We prove that ...
A connected graph having large minimum vertex degree must have a spanning tree with many leaves. In ...
Consider a connected graph G and let T be a spanning tree of G. Every edge e∈G−T induces a cycle in ...
In the spanning tree congestion problem, given a connected graph $G$, the objective is to compute a ...
We study the problem of determining the spanning tree congestion of a graph. We present some sharp c...
AbstractWe prove that every connected graph G of order n has a spanning tree T such that for every e...
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 connected graph and T be a spanning tree of G. For e∈E(T), the congestion of e is...
AbstractLet G be a finite connected graph and T be a spanning tree. For any edge e of T, let Ae,Be b...
AbstractThis paper investigates the problem of embedding a graph into a tree with the same vertex se...
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...
Let G=(V,E) be a complete n-vertex graph with distinct positive edge weights. We prove that for k{1,...
AbstractGiven a graph G, for an integer c∈{2,…,|V(G)|}, define λc(G)=min{|X|:X⊆E(G),ω(G−X)≥c}. For a...
Given a weighted graph G = (V;E), a positive integer k, and a penalty fun tion w p, we want to nd k ...
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 ...
AbstractLet G=(V,E) be a complete n-vertex graph with distinct positive edge weights. We prove that ...
A connected graph having large minimum vertex degree must have a spanning tree with many leaves. In ...
Consider a connected graph G and let T be a spanning tree of G. Every edge e∈G−T induces a cycle in ...
In the spanning tree congestion problem, given a connected graph $G$, the objective is to compute a ...
We study the problem of determining the spanning tree congestion of a graph. We present some sharp c...
DOI
Add to ORKG