Finding the maximum subgraph of prescribed strength (Q6848854)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8168634
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the maximum subgraph of prescribed strength |
scientific article; zbMATH DE number 8168634 |
Statements
Finding the maximum subgraph of prescribed strength (English)
0 references
5 March 2026
0 references
graph connectivity
0 references
maximum subgraph problem
0 references
spanning tree packing problem
0 references
strength of a graph
0 references
0 references
0 references
0 references
