Cycle partition of two-connected and two-edge connected graphs (Q2516513): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11786-015-0231-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2140037005 / rank | |||
Normal rank | |||
Revision as of 03:06, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cycle partition of two-connected and two-edge connected graphs |
scientific article |
Statements
Cycle partition of two-connected and two-edge connected graphs (English)
0 references
3 August 2015
0 references
\(c\)-partitionable graphs
0 references
two-connected graphs
0 references
two-edge connected graphs
0 references
Nielsen's conjecture
0 references
\(\alpha\)-partitionable graphs
0 references
\(\omega\)-partitionable graphs
0 references
