Reproduce “b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.