The \((2k-1)\)-connected multigraphs with at most \(k-1\) disjoint cycles (Q1705804)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The (2k-1)-connected multigraphs with at most k-1 disjoint cycles |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \((2k-1)\)-connected multigraphs with at most \(k-1\) disjoint cycles |
scientific article |
Statements
The \((2k-1)\)-connected multigraphs with at most \(k-1\) disjoint cycles (English)
0 references
16 March 2018
0 references
multigraphs
0 references
cycles
0 references
0.8926891684532166
0 references
0.8871170282363892
0 references
0.8460530638694763
0 references
0.8289311528205872
0 references
0.8209431171417236
0 references
