Paper Citation Record · LEDGER

The minimum size of a $k$-connected locally nonforesty graph

As of 13 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 0 inbound Pith citation observations for arXiv:2501.13980.

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

pith.paper-citation-record.v1
2501.13980 v1

Coverage vector

measured 9 of 9 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-10T16:26:26.235193Z

measured 9 of 9 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+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

9 of 9 outbound references displayed

verified exact1
verified fuzzy7
unresolved1
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 2503c9b4-811a-4953-896c-8251fc9f3e44 · outbound

This paper cites Asratian, Every 3-connected, locally connected, claw-fre e graph is Hamilton- connected, J.

The minimum size of a $k$-connected locally nonforesty graph Asratian, Every 3-connected, locally connected, claw-fre e graph is Hamilton- connected, J

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T16:26:26.394587Z

Source-reported events for the cited work

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

Observation 7026bcd1-ad7a-44b0-ada8-6caa7ce26cf2 · outbound

This paper cites Bondy and U.S.R.

The minimum size of a $k$-connected locally nonforesty graph Bondy and U.S.R

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T16:26:26.380008Z

Source-reported events for the cited work

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

Observation 849f1244-70a0-4f8a-b03d-a0a8d5a9846a · outbound

This paper cites Chartrand, R.J.

The minimum size of a $k$-connected locally nonforesty graph Chartrand, R.J

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T16:26:26.364841Z

Source-reported events for the cited work

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

Observation a9566051-c9d2-4571-ba2a-58f1c45aa2ee · outbound

This paper cites Forest Cuts in Sparse Graphs.

The minimum size of a $k$-connected locally nonforesty graph Forest Cuts in Sparse Graphs

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-10T16:26:26.213199Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c3ac5f0e-ebca-4875-b46d-1e9bad404274 · outbound

This paper cites Davies and C.

The minimum size of a $k$-connected locally nonforesty graph Davies and C

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T16:26:26.349865Z

Source-reported events for the cited work

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

Observation b9d064f1-7b2d-4ff0-a514-eeca6d145edf · outbound

This paper cites The minimum size of a $3$-connected locally nonforesty graph.

The minimum size of a $k$-connected locally nonforesty graph The minimum size of a $3$-connected locally nonforesty graph

Reference 6

Resolution: verified exact; local_arxiv, observed 2026-08-10T16:26:26.275280Z

Source-reported events for the cited work

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

Observation 1e05e464-f10e-46a6-aab7-b8fd700e81d3 · outbound

This paper cites Oberly and D.P.

The minimum size of a $k$-connected locally nonforesty graph Oberly and D.P

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T16:26:26.334598Z

Source-reported events for the cited work

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

Observation 247c1118-6fed-4384-8528-5eb868c9a163 · outbound

This paper cites West, Research problems, Discrete Math., 272(2003), 301 -306.

The minimum size of a $k$-connected locally nonforesty graph West, Research problems, Discrete Math., 272(2003), 301 -306

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T16:26:26.320128Z

Source-reported events for the cited work

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

Observation 922049d3-e343-4f56-8320-326d32d4fb25 · outbound

This paper cites West, Introduction to Graph Theory, Prentice Hall, Inc., 19 96.

The minimum size of a $k$-connected locally nonforesty graph West, Introduction to Graph Theory, Prentice Hall, Inc., 19 96

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T16:26:26.306089Z

Source-reported events for the cited work

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

Pith citing papers

No inbound Pith citation observations are available.