Paper Citation Record · LEDGER

Reducibility among NP-Hard graph problems and boundary classes

As of 12 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2411.14553.

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

pith.paper-citation-record.v1
2411.14553 v2

Coverage vector

measured 21 of 21 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-12T15:22:00.649615Z

measured 21 of 21 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

21 of 21 outbound references displayed

verified exact0
verified fuzzy19
unresolved2
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation ce1c01f3-71a9-42a2-aa9e-64e329c3c38c · outbound

This paper cites A boundary property for upper domination.

Reducibility among NP-Hard graph problems and boundary classes A boundary property for upper domination

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.972067Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation d28f08ae-d377-49af-89f5-57f0129fc06d · outbound

This paper cites On easy and hard hereditary classes of graphs with respect to the independent set problem.

Reducibility among NP-Hard graph problems and boundary classes On easy and hard hereditary classes of graphs with respect to the independent set problem

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.958689Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 5fcbb75d-f0a6-48ca-9980-f6bc5120b527 · outbound

This paper cites NP-hard graph problems and boundary classes of graphs.

Reducibility among NP-Hard graph problems and boundary classes NP-hard graph problems and boundary classes of graphs

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.946631Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 0001f0b6-b87a-461b-8658-27730f63f0db · outbound

This paper cites Boundary classes of graphs for the dominating set problem.

Reducibility among NP-Hard graph problems and boundary classes Boundary classes of graphs for the dominating set problem

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.931848Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation bc1e0f82-2c7d-43ed-a373-db94f5055a7d · outbound

This paper cites On the complexity of the dominating induced matching problem in hereditary classes of graphs.

Reducibility among NP-Hard graph problems and boundary classes On the complexity of the dominating induced matching problem in hereditary classes of graphs

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.919557Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 352243f1-d04a-4f37-a089-884cc7ff0a21 · outbound

This paper cites an unresolved cited work.

Reducibility among NP-Hard graph problems and boundary classes Unresolved cited work

Reference 6

Resolution: unresolved; raw_fallback, observed 2026-08-12T15:22:00.906994Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 51308afb-de19-47e2-8d3b-87ee45011c8c · outbound

This paper cites Computers and Intractability; A Guide to the Theory of NP- Completeness.

Reducibility among NP-Hard graph problems and boundary classes Computers and Intractability; A Guide to the Theory of NP- Completeness

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.893746Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 9dda662e-91bd-4262-bbe9-70db6e1a181d · outbound

This paper cites Reducibility among combinatorial problems.

Reducibility among NP-Hard graph problems and boundary classes Reducibility among combinatorial problems

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.878284Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 5708ed10-0388-4d89-8cb5-7f0b77421b44 · outbound

This paper cites A boundary class for the k-path partition problem.

Reducibility among NP-Hard graph problems and boundary classes A boundary class for the k-path partition problem

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.863525Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a07f0d2b-ae72-4f3a-8217-8e03f1129c17 · outbound

This paper cites Boundary properties of graphs for algorithmic graph problems.

Reducibility among NP-Hard graph problems and boundary classes Boundary properties of graphs for algorithmic graph problems

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.845546Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 51b3f49a-ea00-428d-ba14-57e746c0e507 · outbound

This paper cites Hamiltonian cycles in subcubic graphs: What makes the problem difficult.

Reducibility among NP-Hard graph problems and boundary classes Hamiltonian cycles in subcubic graphs: What makes the problem difficult

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.829361Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 3b1385a5-79cd-4210-beb4-735cba5ee821 · outbound

This paper cites On intersection and symmetric difference of families of boundary classes in the problems on colouring and on the chromatic number.

Reducibility among NP-Hard graph problems and boundary classes On intersection and symmetric difference of families of boundary classes in the problems on colouring and on the chromatic number

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.814765Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 6adfba48-a61e-4e8a-bc76-54879a81ecb6 · outbound

This paper cites A study of the boundary graph classes for colorability problems.

Reducibility among NP-Hard graph problems and boundary classes A study of the boundary graph classes for colorability problems

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.799847Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a55174e6-21ab-4d54-94b0-8d19c897e253 · outbound

This paper cites Boundary graph classes for some maximum induced subgraph problems.

Reducibility among NP-Hard graph problems and boundary classes Boundary graph classes for some maximum induced subgraph problems

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.786430Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 50ae7999-5616-4147-8f1f-d931a794ca3f · outbound

This paper cites Classes of graphs critical for the edge list-ranking problem.

Reducibility among NP-Hard graph problems and boundary classes Classes of graphs critical for the edge list-ranking problem

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.767999Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 718fcc5a-0929-48ec-87dc-741f5e1ae793 · outbound

This paper cites The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices.

Reducibility among NP-Hard graph problems and boundary classes The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.754870Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 4d9e0d77-edbb-4162-bd11-d2787660e761 · outbound

This paper cites A complexity dichotomy and a new boundary class for the dominating set problem.

Reducibility among NP-Hard graph problems and boundary classes A complexity dichotomy and a new boundary class for the dominating set problem

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.739146Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation ce522f8e-d414-47ef-892d-ffb1a6417878 · outbound

This paper cites Boundary classes for graph problems involving non-local properties.

Reducibility among NP-Hard graph problems and boundary classes Boundary classes for graph problems involving non-local properties

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.724092Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 09f8618d-829e-4d11-a4a7-c4aa71e6d1fb · outbound

This paper cites Role colouring graphs in hereditary classes.

Reducibility among NP-Hard graph problems and boundary classes Role colouring graphs in hereditary classes

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.711252Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 84b38e82-2e08-46b8-9ba7-97ef7ebb6502 · outbound

This paper cites Introduction to the Theory of Computation.

Reducibility among NP-Hard graph problems and boundary classes Introduction to the Theory of Computation

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-12T15:22:00.644868Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ac6e945c-edf8-46ed-8729-33318fb32b48 · outbound

This paper cites Introduction to Graph Theory.

Reducibility among NP-Hard graph problems and boundary classes Introduction to Graph Theory

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:22:00.686520Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Pith citing papers

No inbound Pith citation observations are available.