pith. sign in

Title resolution pending

Beverly Jamison, Stephan Olariu,RecognizingP4-sparse graphs in linear time, SIAM Journal on Computing21( · 1992

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

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Carath\'eodory Number in Cycle Convexity

math.CO · 2026-04-22 · unverdicted · novelty 7.0

Deciding the Carathéodory number in cycle convexity is NP-complete even on bipartite graphs, with exact values or constant upper bounds obtained for forests, cycles, complete graphs, split graphs, and several other classes.

citing papers explorer

Showing 1 of 1 citing paper.

  • Carath\'eodory Number in Cycle Convexity math.CO · 2026-04-22 · unverdicted · none · ref 29

    Deciding the Carathéodory number in cycle convexity is NP-complete even on bipartite graphs, with exact values or constant upper bounds obtained for forests, cycles, complete graphs, split graphs, and several other classes.