Topics
connected graphAutomobile
We 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 n^{\frac{3}{2}} many edges which solves a problem posed by Ostrovskii (Minimal congestion trees, Discrete Math. 285 (2004), 219-226.
This dissertation focuses on connectivity, edge connectivity and edge-disjoint spanning trees in gra...
AbstractWe give a short elementary proof of Tutte and Nash-Williams’ characterization of graphs with...
This thesis investigates several aspects of connectivity, mainly focusing on the structure of highly...
We prove that every connected graph G of order n has a spanning tree T such that for every edge e of...
AbstractWe prove that every connected graph G of order n has a spanning tree T such that for every e...
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...
AbstractLet G be a finite connected graph and T be a spanning tree. For any edge e of T, let Ae,Be b...
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 ...
AbstractIn this paper, we present some sharp upper bounds for the number of spanning trees of a conn...
AbstractWe show that for positive integers n, m with n(n−1)/2≥m≥n−1, the graph Ln,m having n vertice...
AbstractIt is shown that an n-edge connected graph has at least ⌈(n − 1)2⌉ pairwise edge-disjoint sp...
AbstractGiven a graph G, for an integer c∈{2,…,|V(G)|}, define λc(G)=min{|X|:X⊆E(G),ω(G−X)≥c}. For a...
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...
This dissertation focuses on connectivity, edge connectivity and edge-disjoint spanning trees in gra...
AbstractWe give a short elementary proof of Tutte and Nash-Williams’ characterization of graphs with...
This thesis investigates several aspects of connectivity, mainly focusing on the structure of highly...
We prove that every connected graph G of order n has a spanning tree T such that for every edge e of...
AbstractWe prove that every connected graph G of order n has a spanning tree T such that for every e...
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...
AbstractLet G be a finite connected graph and T be a spanning tree. For any edge e of T, let Ae,Be b...
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 ...
AbstractIn this paper, we present some sharp upper bounds for the number of spanning trees of a conn...
AbstractWe show that for positive integers n, m with n(n−1)/2≥m≥n−1, the graph Ln,m having n vertice...
AbstractIt is shown that an n-edge connected graph has at least ⌈(n − 1)2⌉ pairwise edge-disjoint sp...
AbstractGiven a graph G, for an integer c∈{2,…,|V(G)|}, define λc(G)=min{|X|:X⊆E(G),ω(G−X)≥c}. For a...
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...
This dissertation focuses on connectivity, edge connectivity and edge-disjoint spanning trees in gra...
AbstractWe give a short elementary proof of Tutte and Nash-Williams’ characterization of graphs with...
This thesis investigates several aspects of connectivity, mainly focusing on the structure of highly...
Add to ORKG