Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-05-08T01:42:21.631764Z
Paper Citation Record · LEDGER
As of 14 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2604.24325.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-05-08T01:42:21.631764Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
30 of 30 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation 92a02044-bc7b-4052-99e0-4070a29c4a21 · outbound
Identification to Subclasses of Chordal Graphs Easy problems for tree-decomposable graphs
Reference 1
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 078ad853-fed5-4217-bb8d-0536ca12ac86 · outbound
Identification to Subclasses of Chordal Graphs The complexity of surjective homomorphism problems - a survey.Discrete Applied Mathematics, 160:1680–1690
Reference 2
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation e7dced54-6c7d-41d9-a1a9-1b28df9d8c4a · outbound
Identification to Subclasses of Chordal Graphs Brouwer and Henk Jan Veldman
Reference 3
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation bbfbad41-9f8c-46dc-bd90-23810253dd24 · outbound
Identification to Subclasses of Chordal Graphs Improvedparameterizedupperboundsforvertexcover
Reference 4
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 5aab3e8f-639a-43d9-8820-d84cd42c591f · outbound
Identification to Subclasses of Chordal Graphs The monadic second-order logic of graphs
Reference 5
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 77ce5868-f4b8-443a-a5c8-e4a4852efda3 · outbound
Identification to Subclasses of Chordal Graphs Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms
Reference 6
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 42f6838b-abe0-47dd-8b5f-4037305900ab · outbound
Identification to Subclasses of Chordal Graphs Unresolved cited work
Reference 7
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 71bdaa1b-35e4-4587-9754-f874dd07fd65 · outbound
Identification to Subclasses of Chordal Graphs On rigid circuit graphs.Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 25:71–76
Reference 8
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation fd9ab109-b5ab-4242-bb79-536332a5fd27 · outbound
Identification to Subclasses of Chordal Graphs Incompressibility through colors and ids
Reference 9
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 9445d7f5-bf8e-4c6a-88ef-e02e37dc0f36 · outbound
Identification to Subclasses of Chordal Graphs Downey and Michael R
Reference 10
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation eccea34b-862f-410f-aceb-acf2442f298f · outbound
Identification to Subclasses of Chordal Graphs 8 David Eppstein
Reference 11
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 6882558d-8719-4540-9c2b-4f87d2cc6966 · outbound
Identification to Subclasses of Chordal Graphs Unresolved cited work
Reference 12
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 0c78ffcf-1e8b-42b3-8ba4-7c14d2643aac · outbound
Identification to Subclasses of Chordal Graphs Golovach, Daniël Paulusma, and Iain A
Reference 13
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 51d28bfd-9c6b-4482-a8bd-3bbc41a896e8 · outbound
Identification to Subclasses of Chordal Graphs Golovach, Pim van ’t Hof, and Daniël Paulusma
Reference 14
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 924d4d01-da4a-4034-8f03-ed189ec537f0 · outbound
Identification to Subclasses of Chordal Graphs The price of homogeneity is polynomial
Reference 15
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation bb0e34aa-817d-4a6d-9f1a-767ff0e340bf · outbound
Identification to Subclasses of Chordal Graphs A faster FPT algorithm for bipartite contraction.Information Processing Letters, 113:906–912
Reference 16
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation c217132f-2eb2-4be3-a3ed-6126fa3d0519 · outbound
Identification to Subclasses of Chordal Graphs Con- tracting graphs to paths and trees.Algorithmica, 68:109–132
Reference 17
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 2342531b-2848-4512-b749-d1ef1219c196 · outbound
Identification to Subclasses of Chordal Graphs Obtaining a bipartite graph by contracting few edges.SIAM Journal Discrete Mathematics, 27:2143–2156
Reference 18
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation e641e608-f7d5-412b-b20a-5098bf6b83e5 · outbound
Identification to Subclasses of Chordal Graphs Bin packing with fixed number of bins revisited.J
Reference 19
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 34ad8ebb-160f-495f-9482-7a89d28100f7 · outbound
Identification to Subclasses of Chordal Graphs Improved Distance (Sensitivity) Oracles with Subquadratic Space
Reference 20
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 6dc39ce5-8a82-465d-acd7-84bec8e186a9 · outbound
Reference 21
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 40042130-f896-4222-a8c4-04326e711391 · outbound
Reference 22
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 54a4c3c2-8771-42f8-9eb1-00e095386383 · outbound
Reference 23
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation b6e3e269-af82-4855-a530-26b974a2c947 · outbound
Reference 24
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 00921780-8cb4-4bf7-9abe-a8e819cbc504 · outbound
Identification to Subclasses of Chordal Graphs Unresolved cited work
Reference 25
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation a895a3e1-2111-43c7-8053-85d8337838ae · outbound
Identification to Subclasses of Chordal Graphs Journal of Combinatorial Theory, Series B , volume =
Reference 26
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 68eb7508-ea39-4cee-8e8f-53ad20f4ab11 · outbound
Reference 27
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 1c3c8798-8581-4782-a8c4-2a7e3fe90e90 · outbound
Identification to Subclasses of Chordal Graphs Computational complexity of compaction to reflexive cycles.SIAM Journal on Computing, 32(1):253–280
Reference 28
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 02aeecee-9508-4b75-b23d-da73ac7d5f5b · outbound
Identification to Subclasses of Chordal Graphs Compaction, retraction, and constraint satisfaction.SIAM Journal on Computing, 33(4):761–782
Reference 29
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 284ef41a-4b5a-42c4-ab65-83915fe1a8f4 · outbound
Identification to Subclasses of Chordal Graphs Algorithms for partition of some class of graphs under compaction and vertex-compaction
Reference 30
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
No inbound Pith citation observations are available.