On the Minimum Number of Spanning Trees in<i>k</i>-Edge-Connected Graphs (Q2978176): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56926462, #quickstatements; #temporary_batch_1714942991822 |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1002/jgt.22026 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2302210904 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56926462 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 23:03, 5 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Minimum Number of Spanning Trees in<i>k</i>-Edge-Connected Graphs |
scientific article |
Statements
On the Minimum Number of Spanning Trees in<i>k</i>-Edge-Connected Graphs (English)
0 references
21 April 2017
0 references
spanning tree
0 references
cubic graph
0 references
edge connectivity
0 references