AbstractA tree decomposition of a graph G is a family of subtrees whose sets of edges partition the set of edges of G. The minimum number of trees in a tree decomposition is the tree number of G. We show that regular graphs with maximum edge connectivity have the minimum possible tree number, whereas graphs with odd degree may have tree number arbitrarily close to its upperbound
AbstractFor a connected simple graph G let L(G) denote the maximum number of leaves in any spanning ...
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at l...
The Erdös–Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k − 1)/2 co...
AbstractWe consider the minimum number ⊤(G) of subsets into which the edge set E(G) of a graph G can...
AbstractA tree decomposition of a graph G is a family of subtrees whose sets of edges partition the ...
AbstractWe investigate those graphs Gn with the property that any tree on n vertices occurs as subgr...
A tree decomposition of a graph G is a family of subtrees whose sets of edges partition the set of e...
Abstract. For all fixed trees T and any graph G we derive a counting formula for the number N̂T (G) ...
The arboricity $\Gamma(G)$ of an undirected graph $G = (V,E)$ is the minimal number such that $E$ ca...
AbstractA forest decomposition of a multigraph G is a family of edge-disjoint subforests of G whose ...
AbstractThe k-linear arboricity of a graph G is the minimum number of forests whose connected compon...
AbstractHenning and Yeo proved a lower bound for the minimum size of a maximum matching in a connect...
A "tree-partition" of a graph $G$ is a partition of $V(G)$ such that identifying the vertices in eac...
AbstractThe lower bounds on the cardinality of the maximum matchings of regular multigraphs are esta...
AbstractA star forest is a forest whose connected components are stars. The star arboricity st(G) of...
AbstractFor a connected simple graph G let L(G) denote the maximum number of leaves in any spanning ...
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at l...
The Erdös–Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k − 1)/2 co...
AbstractWe consider the minimum number ⊤(G) of subsets into which the edge set E(G) of a graph G can...
AbstractA tree decomposition of a graph G is a family of subtrees whose sets of edges partition the ...
AbstractWe investigate those graphs Gn with the property that any tree on n vertices occurs as subgr...
A tree decomposition of a graph G is a family of subtrees whose sets of edges partition the set of e...
Abstract. For all fixed trees T and any graph G we derive a counting formula for the number N̂T (G) ...
The arboricity $\Gamma(G)$ of an undirected graph $G = (V,E)$ is the minimal number such that $E$ ca...
AbstractA forest decomposition of a multigraph G is a family of edge-disjoint subforests of G whose ...
AbstractThe k-linear arboricity of a graph G is the minimum number of forests whose connected compon...
AbstractHenning and Yeo proved a lower bound for the minimum size of a maximum matching in a connect...
A "tree-partition" of a graph $G$ is a partition of $V(G)$ such that identifying the vertices in eac...
AbstractThe lower bounds on the cardinality of the maximum matchings of regular multigraphs are esta...
AbstractA star forest is a forest whose connected components are stars. The star arboricity st(G) of...
AbstractFor a connected simple graph G let L(G) denote the maximum number of leaves in any spanning ...
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at l...
The Erdös–Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k − 1)/2 co...
DOI
Add to ORKG