Weakly clique irreducibility of NEPS of two graphs (Q2870971)
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: Weakly clique irreducibility of NEPS of two graphs |
scientific article; zbMATH DE number 6248723
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weakly clique irreducibility of NEPS of two graphs |
scientific article; zbMATH DE number 6248723 |
Statements
21 January 2014
0 references
weakly clique irreducible graphs
0 references
non-complete extended \(p\)-sum (NEPS)
0 references
0.89192283
0 references
0.88196254
0 references
0.86725473
0 references
0.8659407
0 references
0.86514336
0 references
0.8597698
0 references
0 references
Weakly clique irreducibility of NEPS of two graphs (English)
0 references
