The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
Abstract
A fully polynomial randomized approximation scheme is presented for estimating the number of (vertex) k‐colorings of a graph of maximum degree Δ, when k ≥ 2Δ + 1. © 1995 John Wiley & Sons, Inc.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Some simplified NP-complete graph problems
Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90059-1 · Cited by 2,059
Group representations in probability and statistics
Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381
Random generation of combinatorial structures from a uniform distribution
Jerrum, M. R., Valiant, L. G., & Vazirani, V. V. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90174-x · Cited by 985
Self-citationRandom walks on finite groups and rapidly mixing markov chains
Aldous, D. (1983) · Lecture notes in mathematics · doi:10.1007/bfb0068322 · Cited by 450
Monte-Carlo algorithms for enumeration and reliability problems
Karp, R. M., & Luby, M. G. (1983) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1983.35 · Cited by 320
Cited by
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Quantum speedup of Monte Carlo methods
Montanaro, A. (2015) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2015.0301 · Cited by 334
Bellare, M., Ristenpart, T., Rogaway, P., & Stegers, T. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-05445-7_19 · Cited by 274
Rapidly mixing Markov chains with applications in computer science and physics
Randall, D. (2006) · Computing in Science & Engineering · doi:10.1109/mcse.2006.30 · Cited by 92
Metadata
- Authors
- Jerrum, M.
- Venue
- Random Structures & Algorithms
- Publisher
- Wiley
- Published
- 1995-09
- Volume
- 7
- Issue
- 2
- Pages
- 157-165
- ISSN
- 1042-9832 (ISSN-L)
- 1098-2418
- OpenAlex
- W2109260999
- Cited by
- 288
- References
- 5
- FWCI
- 6.12
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph. https://app.cochat.ai/papers/10.1002/rsa.3240070205
- The paper
- Jerrum, M. (1995). A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph. Random Structures & Algorithms. https://doi.org/10.1002/rsa.3240070205
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.