The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Matching, Euler tours and the Chinese postman
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
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Self-citation
Cited by
Assembly of long, error-prone reads using repeat graphs
Kolmogorov, M., Yuan, J., Lin, Y., & Pevzner, P. A. (2019) · Nature Biotechnology · doi:10.1038/s41587-019-0072-8 · Cited by 5,986
Faster Scaling Algorithms for Network Problems
Gabow, H. N., & Tarjan, R. E. (1989) · SIAM Journal on Computing · doi:10.1137/0218069 · Cited by 414
Mega-scale fabrication by Contour Crafting
Khoshnevis, B., Hwang, D., Yao, K. T., & Yeh, Z. (2006) · International Journal of Industrial and Systems Engineering · doi:10.1504/ijise.2006.009791 · Cited by 378
Wong, L. L., Phuah, K. C., Dai, R., Chen, H., Chew, W. S., & Adams, S. (2021) · Chemistry of Materials · doi:10.1021/acs.chemmater.0c03893 · Cited by 303
Sparse blossom: correcting a million errors per core second with minimum-weight matching
Higgott, O., & Gidney, C. (2025) · Quantum · doi:10.22331/q-2025-01-20-1600 · Cited by 180
Metadata
- Authors
- Edmonds, J., & Johnson, E. L.
- Venue
- Mathematical Programming
- Published
- 1973-12
- Volume
- 5
- Issue
- 1
- Pages
- 88-124
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2064284095
- Cited by
- 980
- References
- 1
- FWCI
- 7.31
- 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: Matching, Euler tours and the Chinese postman. https://app.cochat.ai/papers/10.1007/bf01580113
- The paper
- Edmonds, J., & Johnson, E. L. (1973). Matching, Euler tours and the Chinese postman. Mathematical Programming. https://doi.org/10.1007/bf01580113
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.
