A characterization of easily testable induced digraphs and \(k\)-colored graphs (Q2136197)
From MaRDI portal
| Error creating thumbnail: | 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: A characterization of easily testable induced digraphs and k-colored graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of easily testable induced digraphs and \(k\)-colored graphs |
scientific article |
Statements
A characterization of easily testable induced digraphs and \(k\)-colored graphs (English)
0 references
10 May 2022
0 references
\(k\)-colored complete graphs
0 references
property testing
0 references
regularity
0 references
0.7498844265937805
0 references
0.7482565641403198
0 references
0.7472544312477112
0 references
0.739886999130249
0 references
0.7375510931015015
0 references
