Connectivity keeping trees in k-connected graphs (Q2891042): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.20585 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989205613 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Critically n-Connected Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Non-separating trees in connected graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Connectivity keeping edges in graphs with large minimum degree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On critically connected digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Vertices of small degree in critically \(n\)-connected digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Connectivity keeping paths in k-connected graphs / rank | |||
Normal rank | |||
Latest revision as of 08:46, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectivity keeping trees in k-connected graphs |
scientific article |
Statements
Connectivity keeping trees in k-connected graphs (English)
0 references
13 June 2012
0 references
\(k\)-connected graphs
0 references
connectivity
0 references
