Pith. sign in

Paper Citation Record · LEDGER

Finding large $k$-colorable induced subgraphs in (bull, chair)-free and (bull,E)-free graphs

As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2504.04984.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2504.04984 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-05T12:31:08.565041Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-14T18:27:35.532459Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation e06a1adc-cf75-4a36-b7ed-9d9e355bc0cd · inbound

On $k$-colorability of $(bull, H)$-free graphs cites this paper.

On $k$-colorability of $(bull, H)$-free graphs Finding large $k$-colorable induced subgraphs in (bull, chair)-free and (bull,E)-free graphs

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-05T12:31:08.565041Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T12:31:08.565041Z digest=sha256:6b3b4afea6527722c83a84a17a8f0f96b28ab1723abf6f858b84fa7b74e51919

Observation d5a9ad0c-95f0-4fee-a8b4-f2c3a28f68e0 · inbound

The Gallai Vertex Problem is $\Theta_2^p$-Complete cites this paper.

The Gallai Vertex Problem is $\Theta_2^p$-Complete Finding large $k$-colorable induced subgraphs in (bull, chair)-free and (bull,E)-free graphs

Reference 2

Resolution
verified exact
arxiv_id, observed 2026-05-14T18:27:35.535932Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-05-14T18:25:47.246706Z digest=sha256:4ee5f36d580b081150c567c54008afdc0e2ad97c9ef979741e1d534b2d5c6c51