Paper Citation Record · LEDGER

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number

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

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

pith.paper-citation-record.v1
2501.13617 v1

Coverage vector

measured 38 of 38 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-10T15:54:46.640441Z

measured 38 of 38 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

38 of 38 outbound references displayed

verified exact19
verified fuzzy3
unresolved14
parse uncertain0
malformed identifier2
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 6dfb6800-59cd-4c46-b125-830b2993e16d · outbound

This paper cites an unresolved cited work.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Unresolved cited work

Reference 1

Resolution: unresolved; raw_fallback, observed 2026-08-10T15:54:47.571965Z

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 2040b7d1-1d18-4aac-b03f-714c1314a322 · outbound

This paper cites Asymptotically Optimal Vertex Ranking of Planar Graphs.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Asymptotically Optimal Vertex Ranking of Planar Graphs

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-10T15:54:46.465302Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b944a2b2-89cf-47f5-92e6-f2eba5fdee04 · outbound

This paper cites Graphs with linearly bounded R amsey numbers.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Graphs with linearly bounded R amsey numbers

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-10T15:54:46.470629Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 728da93d-45bd-45ad-9bd1-cc64780eb530 · outbound

This paper cites Graph r-hued colorings— A survey.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Graph r-hued colorings— A survey

Reference 4

Resolution: verified exact; doi, observed 2026-08-10T15:54:47.062753Z

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 2b1a391e-df3c-4b81-ae50-98d7473539fb · outbound

This paper cites Improved bounds for centered colorings.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Improved bounds for centered colorings

Reference 5

Resolution: verified exact; doi, observed 2026-08-10T15:54:47.043990Z

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 87a96d49-cd7d-4cd3-be89-9d47f36e338e · outbound

This paper cites Adjacency labelling for planar graphs (and beyond).

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Adjacency labelling for planar graphs (and beyond)

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-10T15:54:46.486987Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 64f91228-f04b-423e-b2c3-26ad95c66072 · outbound

This paper cites an unresolved cited work.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Unresolved cited work

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-10T15:54:46.492939Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 041c31ff-a921-4abe-9166-82883ee65440 · outbound

This paper cites an unresolved cited work.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Unresolved cited work

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-10T15:54:46.497909Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6135ac1a-a734-40fc-b048-5b31f1240011 · outbound

This paper cites On comparable box dimension.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number On comparable box dimension

Reference 9

Resolution: verified exact; doi, observed 2026-08-10T15:54:47.010385Z

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 62805d37-a977-463a-a0f2-19e68477f97e · outbound

This paper cites Boxicity, poset dimension, and excluded minors.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Boxicity, poset dimension, and excluded minors

Reference 10

Resolution: malformed identifier; doi_truncated, observed 2026-08-10T15:54:46.994371Z

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 b95cc620-f82d-4d67-b394-1af92411046b · outbound

This paper cites Coloring and covering nowhere dense graphs.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Coloring and covering nowhere dense graphs

Reference 11

Resolution: verified exact; doi, observed 2026-08-10T15:54:46.978880Z

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 d4caf3d8-da2b-4847-b238-854b7f5ec302 · outbound

This paper cites Deciding first-order properties of nowhere dense graphs.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Deciding first-order properties of nowhere dense graphs

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-10T15:54:46.516825Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02f34cb0-07b2-4f41-ba3c-cf5331be67f6 · outbound

This paper cites List colouring squares of planar graphs.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number List colouring squares of planar graphs

Reference 13

Resolution: verified exact; doi, observed 2026-08-10T15:54:46.953622Z

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 acfd76b8-436d-4977-b97f-198c6b32df3e · outbound

This paper cites Odd colourings, conflict-free colourings and strong colouring numbers.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Odd colourings, conflict-free colourings and strong colouring numbers

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:54:47.553503Z

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 6ae7cc1a-1e4b-4400-89d5-f1bdd62693aa · outbound

This paper cites A simple competitive graph coloring algorithm.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number A simple competitive graph coloring algorithm

Reference 15

Resolution: verified exact; raw_fallback, observed 2026-08-10T15:54:47.328343Z

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 c1a5b72f-f32c-41cc-bdb7-b7df63032e11 · outbound

This paper cites Planar graph coloring with an uncooperative partner.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Planar graph coloring with an uncooperative partner

Reference 16

Resolution: verified exact; doi, observed 2026-08-10T15:54:46.937901Z

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 1c8c3718-1036-46a0-b901-a7a64520d79e · outbound

This paper cites Orderings on graphs and game coloring number.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Orderings on graphs and game coloring number

Reference 17

Resolution: verified exact; raw_fallback, observed 2026-08-10T15:54:47.234294Z

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 e8d11018-d36a-491b-945c-921663e42d0d · outbound

This paper cites Kierstead and William T.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Kierstead and William T

Reference 18

Resolution: malformed identifier; doi_truncated, observed 2026-08-10T15:54:46.921260Z

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 586c3875-c307-4cbd-9ccc-4b3a353275f5 · outbound

This paper cites Dynamic coloring of graphs having no K5 minor.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Dynamic coloring of graphs having no K5 minor

Reference 19

Resolution: verified exact; doi, observed 2026-08-10T15:54:46.905613Z

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 9f0ea318-9160-4e34-a005-7531173def8e · outbound

This paper cites A survey on the distance-colouring of graphs.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number A survey on the distance-colouring of graphs

Reference 20

Resolution: verified exact; doi, observed 2026-08-10T15:54:46.890972Z

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 b1a8df4e-ba04-4b00-8298-a7057c2173ba · outbound

This paper cites Conditional colorings of graphs.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Conditional colorings of graphs

Reference 21

Resolution: verified exact; doi, observed 2026-08-10T15:54:46.876451Z

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 4b8ae1b8-32c3-4ea9-883c-884d707c09b4 · outbound

This paper cites Upper bounds of dynamic chromatic number.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Upper bounds of dynamic chromatic number

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:54:47.536185Z

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 356fbc1b-a3b8-49e4-aac3-a328587556e5 · outbound

This paper cites Dynamic coloring parameters for graphs with given genus.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Dynamic coloring parameters for graphs with given genus

Reference 23

Resolution: verified exact; doi, observed 2026-08-10T15:54:46.861106Z

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 a00ebe1e-87e2-49ff-9308-8de2f5b8ccc4 · outbound

This paper cites Ramanujan graphs.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Ramanujan graphs

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-10T15:54:46.573608Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 76df80f8-b579-43c9-910e-313205534db6 · outbound

This paper cites Element deletion changes in dynamic coloring of graphs.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Element deletion changes in dynamic coloring of graphs

Reference 25

Resolution: verified exact; doi, observed 2026-08-10T15:54:46.835928Z

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 b8e9207f-8849-4c0f-a246-b22e31cc7e3b · outbound

This paper cites Dynamic coloring of graphs.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Dynamic coloring of graphs

Reference 26

Resolution: verified exact; doi, observed 2026-08-10T15:54:46.820678Z

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 a1aa9837-83b0-48db-b1d0-31c3f9b68620 · outbound

This paper cites Grad and classes with bounded expansion I.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Grad and classes with bounded expansion I

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-10T15:54:46.587606Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1837b8ac-b6ba-4058-a09e-ebff67adeb4a · outbound

This paper cites On nowhere dense graphs.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number On nowhere dense graphs

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-10T15:54:46.592477Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c88b352c-34e3-497a-aa16-6e0ae36cf42d · outbound

This paper cites Sparsity: G raphs, structures, and algorithms , volume 28.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Sparsity: G raphs, structures, and algorithms , volume 28

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-10T15:54:46.597566Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 84d28341-eca0-439b-b7cf-072489482a20 · outbound

This paper cites Characterisations and examples of graph classes with bounded expansion.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Characterisations and examples of graph classes with bounded expansion

Reference 30

Resolution: verified exact; doi, observed 2026-08-10T15:54:46.775729Z

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 ce2ffac7-3f1e-4694-805d-d7bb66caaff7 · outbound

This paper cites From sparse graphs to nowhere dense structures: D ecompositions, independence, dualities and limits.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number From sparse graphs to nowhere dense structures: D ecompositions, independence, dualities and limits

Reference 31

Resolution: verified exact; doi, observed 2026-08-10T15:54:46.759508Z

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 4e99c2a5-2614-4882-92d6-02cb142e08b4 · outbound

This paper cites Arrangeability and clique subdivisions.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Arrangeability and clique subdivisions

Reference 32

Resolution: verified exact; doi, observed 2026-08-10T15:54:46.742601Z

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 edf1690a-eef2-4fa0-9c95-4cf63e0a2d6a · outbound

This paper cites Upper bounds of r-hued colorings of planar graphs.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Upper bounds of r-hued colorings of planar graphs

Reference 33

Resolution: verified exact; doi, observed 2026-08-10T15:54:46.726229Z

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 b1de1368-6eb6-4747-b879-831ea58ef21a · outbound

This paper cites Improper Colourings inspired by Hadwiger's Conjecture.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Improper Colourings inspired by Hadwiger's Conjecture

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-10T15:54:46.621123Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c2880966-b1c5-4116-a913-c7632b1d10b6 · outbound

This paper cites Improper colourings inspired by H adwiger's conjecture.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Improper colourings inspired by H adwiger's conjecture

Reference 35

Resolution: verified exact; doi, observed 2026-08-10T15:54:46.693511Z

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 85170768-eeaa-436c-9a2c-4265502fd17d · outbound

This paper cites Graphs with given diameter and a coloring problem.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Graphs with given diameter and a coloring problem

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:54:47.516643Z

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 5c2fa1b4-34b9-4b8c-a1e6-d97625055309 · outbound

This paper cites Colouring graphs with bounded generalized colouring number.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Colouring graphs with bounded generalized colouring number

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-10T15:54:46.635838Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ecc51df2-abd7-4c94-80ed-8349720515c4 · outbound

This paper cites an unresolved cited work.

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number Unresolved cited work

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-10T15:54:46.640441Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.