Pith. sign in

Title resolution pending

· 2021 · DOI 10.1007/s00453-021-00846-3

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.

citation-role summary

background 1

citation-polarity summary

unclear 1

fields

math.CO 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

Treewidth versus clique number. V. Further connections with tree-independence number

math.CO · 2025-05-19 · conditional · novelty 7.0

For complements of line graphs, (tw,omega)-boundedness is equivalent to bounded tree-independence number; (P3+P1)-free graphs have exact tree-independence number equal to their induced biclique number except in one special C5 case; {P4+P1,C4}-free graphs have tree-clique-cover number at most 3.

citing papers explorer

Showing 1 of 1 citing paper.

  • Treewidth versus clique number. V. Further connections with tree-independence number math.CO · 2025-05-19 · conditional · none · ref 8

    For complements of line graphs, (tw,omega)-boundedness is equivalent to bounded tree-independence number; (P3+P1)-free graphs have exact tree-independence number equal to their induced biclique number except in one special C5 case; {P4+P1,C4}-free graphs have tree-clique-cover number at most 3.