Paper Citation Record · LEDGER

Complexity Classification of Colouring Problems with Parity Constraints

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

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

pith.paper-citation-record.v1
2607.16879 v1

Coverage vector

measured 14 of 14 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T19:52:25.629687Z

measured 14 of 14 standing notices

One-hop event checks from named stored sources.

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

14 of 14 outbound references displayed

verified exact5
verified fuzzy0
unresolved7
parse uncertain0
malformed identifier2
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation ef1a99c7-82fc-47e7-b6e6-53629c568385 · outbound

This paper cites an unresolved cited work.

Complexity Classification of Colouring Problems with Parity Constraints Unresolved cited work

Reference 7

Resolution: verified exact; doi, observed 2026-08-01T19:53:24.067558Z

Source-reported events for the cited work

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

Observation 826989b7-e32a-4ae4-9af9-0e7e4efd6393 · outbound

This paper cites Strong odd coloring of sparse graphs.

Complexity Classification of Colouring Problems with Parity Constraints Strong odd coloring of sparse graphs

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T19:52:25.280765Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 87b2b87f-36b5-413b-9941-182fd49694e6 · outbound

This paper cites Colorings with neighborhood parity condition.

Complexity Classification of Colouring Problems with Parity Constraints Colorings with neighborhood parity condition

Reference 13

Resolution: verified exact; local_arxiv, observed 2026-08-01T19:53:23.830945Z

Source-reported events for the cited work

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

Observation a53445b6-cc94-4870-9b30-5548ac1728ab · outbound

This paper cites 10 LenoreCowen, WayneGoddard, andC.EstherJesurum.

Complexity Classification of Colouring Problems with Parity Constraints 10 LenoreCowen, WayneGoddard, andC.EstherJesurum

Reference 1973

Resolution: verified exact; doi, observed 2026-08-01T19:53:24.204808Z

Source-reported events for the cited work

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

Observation 6e644688-37e5-4076-8f7a-06b230299818 · outbound

This paper cites 29 Alex D.

Complexity Classification of Colouring Problems with Parity Constraints 29 Alex D

Reference 1978

Resolution: unresolved; no resolver link, observed 2026-08-01T19:52:25.629687Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a35cbbd9-f0c5-4b37-a1f3-710b9a4a186e · outbound

This paper cites an unresolved cited work.

Complexity Classification of Colouring Problems with Parity Constraints Unresolved cited work

Reference 1981

Resolution: unresolved; no resolver link, observed 2026-08-01T19:52:25.129454Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 61475357-d63a-4300-8f0c-caec55606256 · outbound

This paper cites an unresolved cited work.

Complexity Classification of Colouring Problems with Parity Constraints Unresolved cited work

Reference 1997

Resolution: malformed identifier; no resolver link, observed 2026-08-01T19:52:24.981487Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98255990-c126-430f-9974-58ea086734f6 · outbound

This paper cites 18 Richard M.

Complexity Classification of Colouring Problems with Parity Constraints 18 Richard M

Reference 1999

Resolution: verified exact; doi, observed 2026-08-01T19:53:23.946006Z

Source-reported events for the cited work

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

Observation 712f9f3a-1fee-4633-b87d-a052c7b32180 · outbound

This paper cites A note on the history of the four-colour conjecture.

Complexity Classification of Colouring Problems with Parity Constraints A note on the history of the four-colour conjecture

Reference 2012

Resolution: unresolved; no resolver link, observed 2026-08-01T19:52:25.416199Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8f1b0c8d-f047-4fcb-b0fb-d26a9a8f013f · outbound

This paper cites 9 Vašek Chvátal.

Complexity Classification of Colouring Problems with Parity Constraints 9 Vašek Chvátal

Reference 2013

Resolution: unresolved; no resolver link, observed 2026-08-01T19:52:24.815781Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f3e16302-d1c3-49db-b5ac-1cb64b6bc7db · outbound

This paper cites 5 Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, and Paweł Rzążewski.

Complexity Classification of Colouring Problems with Parity Constraints 5 Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, and Paweł Rzążewski

Reference 2021

Resolution: verified exact; doi, observed 2026-08-01T19:53:24.342608Z

Source-reported events for the cited work

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

Observation f2d79eac-e5c1-47e6-a09c-04bfc092b16b · outbound

This paper cites NP-completeness of finding the chromatic index of regular graphs.

Complexity Classification of Colouring Problems with Parity Constraints NP-completeness of finding the chromatic index of regular graphs

Reference 2024

Resolution: unresolved; no resolver link, observed 2026-08-01T19:52:25.336476Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98746b4d-2330-48f6-bed7-657d21ec7390 · outbound

This paper cites 2025.114601,doi:10.1016/J.DISC.2025.114601.

Complexity Classification of Colouring Problems with Parity Constraints 2025.114601,doi:10.1016/J.DISC.2025.114601

Reference 2025

Resolution: malformed identifier; no resolver link, observed 2026-08-01T19:52:24.732795Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8da1e45a-bc06-4896-b901-ee80321be525 · outbound

This paper cites Optimal b-Colourings and Fall Colourings in $H$-Free Graphs.

Complexity Classification of Colouring Problems with Parity Constraints Optimal b-Colourings and Fall Colourings in $H$-Free Graphs

Reference 2026

Resolution: unresolved; no resolver link, observed 2026-08-01T19:52:24.548235Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.