Pages that link to "Item:Q4680410"
From MaRDI portal
The following pages link to Testing graphs for colorability properties* (Q4680410):
Displaying 11 items.
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- On the benefits of adaptivity in property testing of dense graphs (Q603911) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- Comparing the strength of query types in property testing: the case of \(k\)-colorability (Q1947037) (← links)
- Testing graphs for colorability properties (Q2768393) (← links)
- Testing \(k\)-colorability (Q2784512) (← links)
- Indistinguishability and First-Order Logic (Q3502636) (← links)
- Hypergraph coloring and reconfigured RAM testing (Q4420050) (← links)
- Earthmover Resilience and Testing in Ordered Structures (Q5121906) (← links)
- Non-Deterministic Graph Property Testing (Q5397730) (← links)
- Efficient testing of large graphs (Q5932749) (← links)