Computing sharp 2-factors in claw-free graphs (Q988693): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user 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.1016/j.jda.2009.07.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3032434623 / rank | |||
Normal rank | |||
Revision as of 02:42, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing sharp 2-factors in claw-free graphs |
scientific article |
Statements
Computing sharp 2-factors in claw-free graphs (English)
0 references
18 August 2010
0 references
claw-free graph
0 references
2-factor
0 references
number of components
0 references
polynomial algorithm
0 references
