Pith. sign in

Title resolution pending

· 2019

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

CONDITIONAL 1

representative citing papers

On the structure of perfectly divisible graphs

math.CO · 2025-06-14 · conditional · novelty 6.0

A P5-free minimally non-perfectly divisible graph cannot contain a clique cutset, and recognizing perfectly divisible graphs is NP-hard.

citing papers explorer

Showing 1 of 1 citing paper.

  • On the structure of perfectly divisible graphs math.CO · 2025-06-14 · conditional · none · ref 5

    A P5-free minimally non-perfectly divisible graph cannot contain a clique cutset, and recognizing perfectly divisible graphs is NP-hard.