On the hardness of recognizing triangular line graphs (Q442382)
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: On the hardness of recognizing triangular line graphs |
scientific article; zbMATH DE number 6064680
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hardness of recognizing triangular line graphs |
scientific article; zbMATH DE number 6064680 |
Statements
On the hardness of recognizing triangular line graphs (English)
0 references
10 August 2012
0 references
triangular line graph
0 references
H-line graph
0 references
NP-completeness
0 references
0.7681775093078613
0 references
0.7310922145843506
0 references
0.712114691734314
0 references
0.7105263471603394
0 references
0.7084622979164124
0 references
