Testing graphs for colorability properties*
From MaRDI portal
Publication:4680410
DOI10.1002/rsa.20037zbMath1069.68078OpenAlexW84366483MaRDI QIDQ4680410
Publication date: 1 June 2005
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20037
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items
On the benefits of adaptivity in property testing of dense graphs, Indistinguishability and First-Order Logic, Testable and untestable classes of first-order formulae, Earthmover Resilience and Testing in Ordered Structures
Cites Work
