Packing Steiner trees (Q273179): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 19:45, 11 July 2024

scientific article

Language	Label	Description	Also known as
English	Packing Steiner trees	scientific article

Statements

scholarly article

0 references

Packing Steiner trees (English)

0 references

0 references

Jessica McDonald

0 references

0 references

Journal of Combinatorial Theory. Series B

0 references

publication date

21 April 2016

0 references

full work available at URL

https://arxiv.org/abs/1307.7621

0 references

zbMATH Keywords

Steiner trees

0 references

packing

0 references

MaRDI profile type

0 references

0 references

On decomposing a hypergraph into \(k\) connected sub-hypergraphs

0 references

An approximate max-Steiner-tree-packing min-Steiner-cut theorem

0 references

0 references

Degree Bounded Matroids and Submodular Flows

0 references

Edge-disjoint trees containing some given vertices in a graph

0 references

A Reduction Method for Edge-Connectivity in Graphs

0 references

Edge-Disjoint Spanning Trees of Finite Graphs

0 references

A THEOREM ON INDEPENDENCE RELATIONS

0 references

On the Problem of Decomposing a Graph into <i>n</i> Connected Factors

0 references

Packing of Steiner trees and \(S\)-connectors in graphs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.jctb.2016.02.002

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:273179

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q273179&oldid=36243620"