Bounds on the maximum number of edge-disjoint Steiner trees of a graph
type: Item
instance of: scholarly article
zbMATH Open document ID: 0984.05025
publication date: 2002-05-07T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1599135
zbMATH Keywords: edge-disjoint Steiner trees
zbMATH Keywords: edge-toughness
zbMATH Keywords: edge-connectivity
MaRDI profile type: Publication
author: L. Petingi
author: J. Rodriguez
title: Bounds on the maximum number of edge-disjoint Steiner trees of a graph
published in: Congressus Numerantium
review text: Let \(G\) be a connected graph and let \(K\) be a set of vertices of \(G\) with \(|K|\geq 2\). The paper discusses the problem to estimate the number of edge-disjoint Steiner trees on the set \(K\) in \(G\). It gives bounds of this number in terms of the edge-toughness and the edge-connectivity of \(G\).
reviewed by: Dietmar Cieslik
description: scientific article; zbMATH DE number 1599135