Paper Citation Record · LEDGER

k-Coloring is Faster than Computing the Chromatic Number

As of 12 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 1 inbound Pith citation observation for arXiv:2607.25973.

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

pith.paper-citation-record.v1
2607.25973 v1

Coverage vector

measured 60 of 60 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T01:06:19.463003Z

measured 61 of 61 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-07-30T10:42:28.587548Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

60 of 60 outbound references displayed

verified exact4
verified fuzzy0
unresolved55
parse uncertain1
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 80325775-8957-43fe-8158-afe3f51973d7 · outbound

This paper cites and Tarjan, Robert Endre , title =.

k-Coloring is Faster than Computing the Chromatic Number and Tarjan, Robert Endre , title =

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:13.539361Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 21ea7420-a548-4755-9fb8-dd6e430b8831 · outbound

This paper cites Journal of Algorithms , volume =.

k-Coloring is Faster than Computing the Chromatic Number Journal of Algorithms , volume =

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:13.641061Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4fdcf278-ccee-46a3-bfd0-8b88934b93aa · outbound

This paper cites Fourier Meets.

k-Coloring is Faster than Computing the Chromatic Number Fourier Meets

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:13.709080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 730a0a4f-995e-4bd0-8d19-e6ece7a05b5e · outbound

This paper cites Set Partitioning via Inclusion--Exclusion , journal =.

k-Coloring is Faster than Computing the Chromatic Number Set Partitioning via Inclusion--Exclusion , journal =

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:13.780492Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 81aa6b2c-1124-4bb4-b219-85d47efb16e2 · outbound

This paper cites Parameterized and Exact Computation: Third International Workshop,.

k-Coloring is Faster than Computing the Chromatic Number Parameterized and Exact Computation: Third International Workshop,

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:13.838093Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation abdeeb87-15d8-4a2a-97bd-fb9287474777 · outbound

This paper cites 30th Annual European Symposium on Algorithms (.

k-Coloring is Faster than Computing the Chromatic Number 30th Annual European Symposium on Algorithms (

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:13.943358Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 274c19d2-c4a9-480e-b6d1-e566939b1b9e · outbound

This paper cites 48th International Colloquium on Automata, Languages, and Programming (.

k-Coloring is Faster than Computing the Chromatic Number 48th International Colloquium on Automata, Languages, and Programming (

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:14.042268Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d8f5b783-b200-4ffc-8660-02b92e25c125 · outbound

This paper cites Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages =.

k-Coloring is Faster than Computing the Chromatic Number Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages =

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:14.132343Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee3cb33f-3ce3-4268-bc01-e0f421d8d576 · outbound

This paper cites AI magazine , volume=.

k-Coloring is Faster than Computing the Chromatic Number AI magazine , volume=

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:14.255283Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 398dd319-fb17-4ffe-8149-407be8c9bc87 · outbound

This paper cites A probabilistic algorithm for.

k-Coloring is Faster than Computing the Chromatic Number A probabilistic algorithm for

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:14.324114Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6114a911-7d4f-4a78-a722-a63c369c26a0 · outbound

This paper cites Proc.\ of 41st ICALP.

k-Coloring is Faster than Computing the Chromatic Number Proc.\ of 41st ICALP

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:14.412295Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1027b245-7403-4fe5-9fe7-db5e734309a6 · outbound

This paper cites an unresolved cited work.

k-Coloring is Faster than Computing the Chromatic Number Unresolved cited work

Reference 12

Resolution: parse uncertain; no resolver link, observed 2026-08-01T01:06:14.513725Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a4217fd3-658e-45f8-b24d-d45ee2f2e022 · outbound

This paper cites an unresolved cited work.

k-Coloring is Faster than Computing the Chromatic Number Unresolved cited work

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:14.608151Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7a892462-858c-43ae-8834-539912aecc1f · outbound

This paper cites Discrete Applied Mathematics , volume =.

k-Coloring is Faster than Computing the Chromatic Number Discrete Applied Mathematics , volume =

Reference 14

Resolution: verified exact; doi, observed 2026-08-01T01:11:06.349164Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation cec82ea8-33d2-49f2-b846-f3513dbd2619 · outbound

This paper cites Satisfiability Coding Lemma , journal =.

k-Coloring is Faster than Computing the Chromatic Number Satisfiability Coding Lemma , journal =

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:14.851346Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3ee1888b-8f86-426d-9716-c67687c3ba43 · outbound

This paper cites An Improved Exponential-Time Algorithm for k -.

k-Coloring is Faster than Computing the Chromatic Number An Improved Exponential-Time Algorithm for k -

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:14.947765Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc5d50d7-7ff7-45be-bf34-145ab21f8e49 · outbound

This paper cites An improved exponential-time algorithm for k -.

k-Coloring is Faster than Computing the Chromatic Number An improved exponential-time algorithm for k -

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:15.058735Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 92ff1316-9bbe-4402-8130-42d7cd88bc4d · outbound

This paper cites Proc.\ of 44th ICALP , pages =.

k-Coloring is Faster than Computing the Chromatic Number Proc.\ of 44th ICALP , pages =

Reference 18

Resolution: verified exact; doi, observed 2026-08-01T01:11:06.290584Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation be87f220-fec3-47c5-a105-944213de196b · outbound

This paper cites An Improvement of the Algorithm of.

k-Coloring is Faster than Computing the Chromatic Number An Improvement of the Algorithm of

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:15.291031Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f04d56ed-04a9-47e3-bf2d-abc8461f277a · outbound

This paper cites A New Approach on Solving 3-Satisfiability , booktitle =.

k-Coloring is Faster than Computing the Chromatic Number A New Approach on Solving 3-Satisfiability , booktitle =

Reference 20

Resolution: verified exact; doi, observed 2026-08-01T01:11:06.220727Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 41174625-0086-49b1-bcae-95a0fca61392 · outbound

This paper cites Steinberger , title =.

k-Coloring is Faster than Computing the Chromatic Number Steinberger , title =

Reference 21

Resolution: verified exact; doi, observed 2026-08-01T01:11:06.162136Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 3c3e4ad3-5ced-4ce0-bcad-7718226205c4 · outbound

This paper cites Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , pages=.

k-Coloring is Faster than Computing the Chromatic Number Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , pages=

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:15.616152Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f3ff9599-cd3c-4c62-bc35-e5a0afba4101 · outbound

This paper cites 3-coloring in time.

k-Coloring is Faster than Computing the Chromatic Number 3-coloring in time

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:15.739846Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 297c9257-d9f6-4d4c-86e0-8f686e0b42f0 · outbound

This paper cites ACM Transactions on Algorithms (TALG) , volume=.

k-Coloring is Faster than Computing the Chromatic Number ACM Transactions on Algorithms (TALG) , volume=

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:15.859043Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 41cd1fd0-8785-46a5-b649-15a8468287fe · outbound

This paper cites International Computing and Combinatorics Conference , pages=.

k-Coloring is Faster than Computing the Chromatic Number International Computing and Combinatorics Conference , pages=

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:15.945251Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 908611b9-d7d2-4dae-9bae-8900991127a6 · outbound

This paper cites Information and Computation , volume=.

k-Coloring is Faster than Computing the Chromatic Number Information and Computation , volume=

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:16.019974Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cd13d222-f512-4a0b-ba76-a7359383fd76 · outbound

This paper cites Graph colouring algorithms , DOI=.

k-Coloring is Faster than Computing the Chromatic Number Graph colouring algorithms , DOI=

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:16.119563Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 68bb3a1f-d697-46f6-858d-bcb71ee24e85 · outbound

This paper cites On the foundations of combinatorial theory I.

k-Coloring is Faster than Computing the Chromatic Number On the foundations of combinatorial theory I

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:16.254275Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94aefabb-e258-480d-b6f1-d3bd2685dc75 · outbound

This paper cites 1937 , publisher=.

k-Coloring is Faster than Computing the Chromatic Number 1937 , publisher=

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:16.336415Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c2926c6f-0979-4ec7-9ce1-24f4b53f12b5 · outbound

This paper cites The art of computer programming , volume=.

k-Coloring is Faster than Computing the Chromatic Number The art of computer programming , volume=

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:16.522346Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d3cf176c-2efa-4eb9-a1ea-b2ac0c73cb40 · outbound

This paper cites IEEE Transactions on Systems, Man, and Cybernetics , volume=.

k-Coloring is Faster than Computing the Chromatic Number IEEE Transactions on Systems, Man, and Cybernetics , volume=

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:16.690160Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7fb7ee02-e9c6-4d3b-855e-ca11b1e93348 · outbound

This paper cites , author=.

k-Coloring is Faster than Computing the Chromatic Number , author=

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:16.816939Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e233555e-03f2-445e-b109-eb58b400890a · outbound

This paper cites Complexity of computer computations , pages=.

k-Coloring is Faster than Computing the Chromatic Number Complexity of computer computations , pages=

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:16.978806Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d6fe0ff7-038e-4ee6-be3b-edf603ea36da · outbound

This paper cites an unresolved cited work.

k-Coloring is Faster than Computing the Chromatic Number Unresolved cited work

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:17.107843Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 01b7eaed-af54-4544-b558-65ecd7140898 · outbound

This paper cites ACM Sigact News , volume=.

k-Coloring is Faster than Computing the Chromatic Number ACM Sigact News , volume=

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:17.259324Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2ef18703-ee43-4b8a-8fae-564d315a4d1f · outbound

This paper cites On the complexity of.

k-Coloring is Faster than Computing the Chromatic Number On the complexity of

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:17.326457Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f4abf2b7-eba7-43b5-960a-8cd6923ccc92 · outbound

This paper cites Exact algorithms for.

k-Coloring is Faster than Computing the Chromatic Number Exact algorithms for

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:17.432025Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ddd35c3a-c65f-4a97-939c-a33b203bc117 · outbound

This paper cites Operations Research Letters , volume=.

k-Coloring is Faster than Computing the Chromatic Number Operations Research Letters , volume=

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:17.523483Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c11ef22e-483a-4acc-bee2-ddf201f46e10 · outbound

This paper cites Israel journal of Mathematics , volume=.

k-Coloring is Faster than Computing the Chromatic Number Israel journal of Mathematics , volume=

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:17.609258Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6c9ebce5-2c7d-429c-a435-2b8fb3889fe3 · outbound

This paper cites IRE Transactions on Electronic Computers , number=.

k-Coloring is Faster than Computing the Chromatic Number IRE Transactions on Electronic Computers , number=

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:17.698632Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ab28eccb-ec82-46e6-ab8b-d372f096304a · outbound

This paper cites Workshop on Algorithms and Data Structures , pages=.

k-Coloring is Faster than Computing the Chromatic Number Workshop on Algorithms and Data Structures , pages=

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:17.834158Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5885e03e-90df-43f1-ad81-11e9edc3e28b · outbound

This paper cites Deciding 3-colourability in less than.

k-Coloring is Faster than Computing the Chromatic Number Deciding 3-colourability in less than

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:17.890413Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 99ef4d34-e00a-492d-871a-c9163aba1ae5 · outbound

This paper cites Communications of the ACM , volume=.

k-Coloring is Faster than Computing the Chromatic Number Communications of the ACM , volume=

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:17.971811Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b06aeadf-c120-4e03-a8ae-7e5ec3cc212d · outbound

This paper cites 2010 , publisher=.

k-Coloring is Faster than Computing the Chromatic Number 2010 , publisher=

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:18.056015Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c5b7ac9b-1497-4862-b0f3-42fb98a7501a · outbound

This paper cites Journal of Computer and System Sciences , volume =.

k-Coloring is Faster than Computing the Chromatic Number Journal of Computer and System Sciences , volume =

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:18.156348Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9b6157c5-772e-4bf5-aeb8-d09cbd41a24a · outbound

This paper cites On Problems as Hard as.

k-Coloring is Faster than Computing the Chromatic Number On Problems as Hard as

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:18.279689Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94b5afb7-ca86-448a-8c00-e1df064e01c2 · outbound

This paper cites Ryan Williams , title =.

k-Coloring is Faster than Computing the Chromatic Number Ryan Williams , title =

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:18.336224Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7ffedad3-67ba-45b8-a3b8-07a50bfa1bc0 · outbound

This paper cites Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science , pages =.

k-Coloring is Faster than Computing the Chromatic Number Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science , pages =

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:18.456723Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 21bc0e98-c885-40dd-b2c7-07da5d0cb436 · outbound

This paper cites Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing , pages =.

k-Coloring is Faster than Computing the Chromatic Number Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing , pages =

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:18.511602Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7194cf35-a682-4f4a-b071-65438293fe88 · outbound

This paper cites Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science , pages =.

k-Coloring is Faster than Computing the Chromatic Number Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science , pages =

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:18.650301Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 965f3d31-ca65-4168-88c8-b37ad06c2930 · outbound

This paper cites Proceedings of the International Congress of Mathematicians 2018 , pages =.

k-Coloring is Faster than Computing the Chromatic Number Proceedings of the International Congress of Mathematicians 2018 , pages =

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:18.771360Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce39dafa-7c60-48e1-9f93-b73dfaa79d5b · outbound

This paper cites Ryan Williams , title =.

k-Coloring is Faster than Computing the Chromatic Number Ryan Williams , title =

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:18.849357Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9498d340-cc91-4c90-a6f7-27c4779738a2 · outbound

This paper cites Theory of Computing Systems , volume=.

k-Coloring is Faster than Computing the Chromatic Number Theory of Computing Systems , volume=

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:18.912791Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a32be275-0d76-4e07-b42a-5ca198bc2152 · outbound

This paper cites Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture , booktitle =.

k-Coloring is Faster than Computing the Chromatic Number Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture , booktitle =

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:18.968236Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9414a8e2-662e-4c43-a2ca-4a9aa4fddcf5 · outbound

This paper cites The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True , booktitle =.

k-Coloring is Faster than Computing the Chromatic Number The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True , booktitle =

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:19.068678Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f8f4d1fe-7582-4ad0-afa6-ff161ae35ca3 · outbound

This paper cites Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC) , pages =.

k-Coloring is Faster than Computing the Chromatic Number Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC) , pages =

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:19.132757Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3749272c-82e4-4c8d-9675-0291c8c17e88 · outbound

This paper cites 32nd Annual European Symposium on Algorithms (ESA 2024) , pages=.

k-Coloring is Faster than Computing the Chromatic Number 32nd Annual European Symposium on Algorithms (ESA 2024) , pages=

Reference 57

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:19.244287Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 50648432-82b1-470e-87df-efa4b600f77a · outbound

This paper cites 3-Coloring in Time O (1.3217\^.

k-Coloring is Faster than Computing the Chromatic Number 3-Coloring in Time O (1.3217\^

Reference 58

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:19.342323Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 86fb0f0d-cc48-4d8d-ae64-fdecd2231069 · outbound

This paper cites Lee , title =.

k-Coloring is Faster than Computing the Chromatic Number Lee , title =

Reference 59

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:19.383719Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 664b753c-206f-4e43-9179-bcc79a3b169b · outbound

This paper cites Theoretical Computer Science , volume =.

k-Coloring is Faster than Computing the Chromatic Number Theoretical Computer Science , volume =

Reference 60

Resolution: unresolved; no resolver link, observed 2026-08-01T01:06:19.463003Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation 227f72be-9f2a-47f2-95f1-74c0b3bfd3ff · inbound

Breaking the $2^n$ barrier for graph $k$-coloring cites this paper.

Breaking the $2^n$ barrier for graph $k$-coloring k-Coloring is Faster than Computing the Chromatic Number

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:28.587548Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.