Testing graphs for colorability properties*
From MaRDI portal
Recommendations
Cites work
Cited in
(16)- Hypergraph coloring and reconfigured RAM testing
- Efficient testing of large graphs
- On the testability of graph partition properties
- Comparing the strength of query types in property testing: the case of testing \(k\)-colorability
- Earthmover Resilience and Testing in Ordered Structures
- Testable and untestable classes of first-order formulae
- Indistinguishability and First-Order Logic
- On the benefits of adaptivity in property testing of dense graphs
- Testing graphs for colorability properties
- Comparing the strength of query types in property testing: the case of \(k\)-colorability
- Testing hypergraph colorability
- Easily testable graph properties
- A note on the testability of Ramsey's class
- scientific article; zbMATH DE number 1754615 (Why is no real title available?)
- Non-deterministic graph property testing
- Testing k-colorability
This page was built for publication: Testing graphs for colorability properties*
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680410)