Pith. sign in

Title resolution pending

Adler, R · 1977 · DOI 10.1007/bf02761605

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

1 Pith paper citing it
open at publisher 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

cs.FL 1

years

2026 1

verdicts

REJECT 1

representative citing papers

Completely Reachable Road Coloring

cs.FL · 2026-07-13 · reject · novelty 7.0

A digraph admits a completely reachable road coloring iff it is strongly connected, aperiodic, and every vertex subset has at least as many in-neighbors as vertices; the fixed-alphabet version is claimed NP-complete, but the proof has a flaw.

citing papers explorer

Showing 1 of 1 citing paper.

  • Completely Reachable Road Coloring cs.FL · 2026-07-13 · reject · none · ref 1

    A digraph admits a completely reachable road coloring iff it is strongly connected, aperiodic, and every vertex subset has at least as many in-neighbors as vertices; the fixed-alphabet version is claimed NP-complete, but the proof has a flaw.