Pith. sign in

Title resolution pending

· 1993

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

2019 1

verdicts

CONDITIONAL 1

representative citing papers

Failed power domination on graphs

math.CO · 2019-09-04 · conditional · novelty 6.0

The failed power domination number is NP-hard to compute, and exact values are given for complete bipartite graphs, ladders, and layered complete graphs.

citing papers explorer

Showing 1 of 1 citing paper.

  • Failed power domination on graphs math.CO · 2019-09-04 · conditional · none · ref 5

    The failed power domination number is NP-hard to compute, and exact values are given for complete bipartite graphs, ladders, and layered complete graphs.