Pith. sign in

Title resolution pending

NP-Hardness of Minimum Recurrent Configuration Problem of Chip-Firing Game on Directed Graphs, Annals of Combinatorics 19 ( · 2015

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

math.CO 1

years

2025 1

verdicts

ACCEPT 1

representative citing papers

An equality for balanced digraphs

math.CO · 2025-07-30 · accept · novelty 7.0

The number of k-arc acyclic subdigraphs in which every vertex can reach a fixed root is independent of the root, for any balanced digraph.

citing papers explorer

Showing 1 of 1 citing paper.

  • An equality for balanced digraphs math.CO · 2025-07-30 · accept · none · ref 6

    The number of k-arc acyclic subdigraphs in which every vertex can reach a fixed root is independent of the root, for any balanced digraph.