The following pages link to Testing <i>k</i>-colorability (Q2784512):
Displaying 17 items.
- On the benefits of adaptivity in property testing of dense graphs (Q603911) (← links)
- Generating all subsets of a finite set with disjoint unions (Q640845) (← links)
- \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
- Property testing of the Boolean and binary rank (Q825974) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- Comparing the strength of query types in property testing: the case of \(k\)-colorability (Q1947037) (← links)
- A lower bound for testing juntas (Q2390270) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Contemplations on Testing Graph Properties (Q3088201) (← links)
- Testing Odd-Cycle-Freeness in Boolean Functions (Q3168444) (← links)
- Introduction to Testing Graph Properties (Q4933365) (← links)
- Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability (Q4933375) (← links)
- (Q5009551) (← links)
- Planar graphs: Random walks and bipartiteness testing (Q5236926) (← links)
- (Q5743465) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
- Testing subgraphs in directed graphs (Q5917574) (← links)
