DOIAbstract
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at least δ is determined for δ⩾5
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at least δ is determined for δ⩾5
Consider the class of graphs on n vertices which have maximum degree at most 1/2 n - 1 + τ, where τ ...
A set of vertices in a graph is connected if it induces a connected subgraph. Using Shearer’s entrop...
We determine the maximum number of edges that a planar graph can have as a function of its maximum d...
AbstractA graph with n vertices and minimum degree k⩾2 can contain no more than (2k−2)n(k2−2) cut ve...
We relate the number of minimum cuts in a weighted undirected graph with various structural paramete...
We relate the number of minimum cuts in a weighted undi- rected graph with various structural param...
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at l...
We investigate the smallest number λe(G) of edges that can be removed from a non-empty graph G so th...
AbstractA tree decomposition of a graph G is a family of subtrees whose sets of edges partition the ...
We investigate the smallest number λ(G) of vertices that need to be removed from a non-empty graph G...
AbstractLet σ(n, k) be the largest number of k-cuts in a k-edge-connected multigraph with n vertices...
AbstractLet G be a finite simple graph on n vertices with minimum degreeδ(G) ⩾ δ (n ≡ δ (mod 2)). Le...
We prove that in an undirected graph there are at most $O(n^2)$ cuts of size strictly less than $\fr...
A block of a graph is a nonseparable maximal subgraph of the graph. We denote by bG the number of bl...
AbstractThe note contains some conditions on a graph implying that the edge connectivity is equal to...
Consider the class of graphs on n vertices which have maximum degree at most 1/2 n - 1 + τ, where τ ...
A set of vertices in a graph is connected if it induces a connected subgraph. Using Shearer’s entrop...
We determine the maximum number of edges that a planar graph can have as a function of its maximum d...
AbstractA graph with n vertices and minimum degree k⩾2 can contain no more than (2k−2)n(k2−2) cut ve...
We relate the number of minimum cuts in a weighted undirected graph with various structural paramete...
We relate the number of minimum cuts in a weighted undi- rected graph with various structural param...
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at l...
We investigate the smallest number λe(G) of edges that can be removed from a non-empty graph G so th...
AbstractA tree decomposition of a graph G is a family of subtrees whose sets of edges partition the ...
We investigate the smallest number λ(G) of vertices that need to be removed from a non-empty graph G...
AbstractLet σ(n, k) be the largest number of k-cuts in a k-edge-connected multigraph with n vertices...
AbstractLet G be a finite simple graph on n vertices with minimum degreeδ(G) ⩾ δ (n ≡ δ (mod 2)). Le...
We prove that in an undirected graph there are at most $O(n^2)$ cuts of size strictly less than $\fr...
A block of a graph is a nonseparable maximal subgraph of the graph. We denote by bG the number of bl...
AbstractThe note contains some conditions on a graph implying that the edge connectivity is equal to...
Consider the class of graphs on n vertices which have maximum degree at most 1/2 n - 1 + τ, where τ ...
A set of vertices in a graph is connected if it induces a connected subgraph. Using Shearer’s entrop...
We determine the maximum number of edges that a planar graph can have as a function of its maximum d...
Add to ORKG