Paper Citation Record · LEDGER

NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs

As of 20 August 2026, this Paper Citation Record lists 11 of 11 outbound references and 0 inbound Pith citation observations for arXiv:2608.06255.

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

pith.paper-citation-record.v1
2608.06255 v1

Coverage vector

measured 11 of 11 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T11:31:27.525421Z

measured 11 of 11 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+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

11 of 11 outbound references displayed

verified exact0
verified fuzzy10
unresolved1
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 58e46738-7262-4373-a81f-c3b7cce06e75 · outbound

This paper cites Abellanas, J.

NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs Abellanas, J

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:31:29.636418Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation f5b19844-7b92-4954-b7f8-23ac3302e6ec · outbound

This paper cites Geometric planar networks on bichromatic collinear points.Theoretical Com- puter Science, 895, 09 2021.

NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs Geometric planar networks on bichromatic collinear points.Theoretical Com- puter Science, 895, 09 2021

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:31:29.346152Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 05bab5ff-b204-412a-ae14-75a34600f61a · outbound

This paper cites Non-crossing Hamiltonian paths and cycles in output-polynomial time.

NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs Non-crossing Hamiltonian paths and cycles in output-polynomial time

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:31:29.064624Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 330d07b4-3e73-46c8-85c3-a7c8b2198205 · outbound

This paper cites Garey and David S.

NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs Garey and David S

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:31:28.819979Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 39095748-4c83-427c-a411-1490b472d8ba · outbound

This paper cites Garey, David S.

NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs Garey, David S

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:31:28.657906Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 14ff1324-6ac1-4414-b1b5-63f3c443d1a5 · outbound

This paper cites Garey, David S.

NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs Garey, David S

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:31:28.499458Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 21a9b858-54dd-460f-ac2b-3ce5351e48fe · outbound

This paper cites Kano.Discrete Geometry on Red and Blue Points in the Plane — A Sur- vey —, pages 551–570.

NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs Kano.Discrete Geometry on Red and Blue Points in the Plane — A Sur- vey —, pages 551–570

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:31:28.336552Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 2cb1e88e-4a62-4280-830b-dddd28461cc9 · outbound

This paper cites Long al- ternating paths in bicolored point sets.Discrete Mathematics, 308(19):4315–4321, 2008.

NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs Long al- ternating paths in bicolored point sets.Discrete Mathematics, 308(19):4315–4321, 2008

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:31:28.173513Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 4c72cc96-c1ab-4291-bee0-9c4946794040 · outbound

This paper cites The NP-completeness of the Hamil- tonian cycle problem in planar digraphs with de- gree bound two.Information Processing Letters, 8(4):199–201, 1979.

NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs The NP-completeness of the Hamil- tonian cycle problem in planar digraphs with de- gree bound two.Information Processing Letters, 8(4):199–201, 1979

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:31:27.961144Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 37d1f494-cc27-4817-b240-fd69d4c31343 · outbound

This paper cites Bicolored point sets admitting non-crossing alternating Hamiltonian paths.

NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs Bicolored point sets admitting non-crossing alternating Hamiltonian paths

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-07T11:31:27.442811Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8ba28391-7057-45d6-b857-5278204bc65f · outbound

This paper cites Enumeration of non-crossing Hamiltonian paths by reachabil- ity checks and bidirectional search.

NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs Enumeration of non-crossing Hamiltonian paths by reachabil- ity checks and bidirectional search

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:31:27.771509Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Pith citing papers

No inbound Pith citation observations are available.