Pith. sign in

Title resolution pending

· 2017

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

Notes on k-rainbow independent domination in graphs

math.CO · 2019-08-05 · conditional · novelty 5.0

For every graph G of order n not isomorphic to C5, the 2-rainbow independent domination numbers of G and its complement sum to at most n+2, improving the prior n+3 bound, and the k-rainbow independent domination decision problem is NP-complete for bipartite graphs.

citing papers explorer

Showing 1 of 1 citing paper.

  • Notes on k-rainbow independent domination in graphs math.CO · 2019-08-05 · conditional · none · ref 7

    For every graph G of order n not isomorphic to C5, the 2-rainbow independent domination numbers of G and its complement sum to at most n+2, improving the prior n+3 bound, and the k-rainbow independent domination decision problem is NP-complete for bipartite graphs.