Recognizing graphs without asteroidal triples (Q876727)
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: Recognizing graphs without asteroidal triples |
scientific article; zbMATH DE number 5147103
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing graphs without asteroidal triples |
scientific article; zbMATH DE number 5147103 |
Statements
Recognizing graphs without asteroidal triples (English)
0 references
26 April 2007
0 references
graph algorithms
0 references
asteroidal triple-free graphs
0 references
recognition algorithm
0 references
knotting graph
0 references
0 references
0 references
0.8446550965309143
0 references
0.8393477201461792
0 references
0.8343063592910767
0 references
