The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Canonical labeling of graphs
Open accessAbstract
We announce an algebraic approach to the problem of assigning canonical forms to graphs. We compute canonical forms and the associated canonical labelings (or renumberings) in polynomial time for graphs of bounded valence, in moderately exponential, exp(n½ + ο(1)),time for general graphs, in subexponential, nlog n, time for tournaments and for 2-(ν,κ,λ) block designs with κ,λ bounded and nlog log n time for λ-planes (symmetric designs) with λ bounded. We prove some related problems NP-hard and indicate some open problems.
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
(1979) · Cited by 43,841
Isomorphism of graphs of bounded valence can be tested in polynomial time
Luks, E. M. (1982) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(82)90009-5 · Cited by 645
Self-citationFinite Permutation Groups and Finite Simple Groups
Cameron, P. J. (1981) · Bulletin of the London Mathematical Society · doi:10.1112/blms/13.1.1 · Cited by 526
SOLVABILITY OF GROUPS OF ODD ORDER
Feit, W., & Thompson, J. G. (2012) · Cited by 385
Hubaut, X. L. (1975) · Discrete Mathematics · doi:10.1016/0012-365x(75)90057-6 · Cited by 241
A note on the graph isomorphism counting problem
Mathon, R. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90004-8 · Cited by 200
P., J. W., & Ryser, H. J. (1964) · Journal of the American Statistical Association · doi:10.2307/2282898 · Cited by 194
Isomorphism of graphs with bounded eigenvalue multiplicity
Babai, L., Grigoryev, D. Y., & Mount, D. M. (1982) · Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 · doi:10.1145/800070.802206 · Cited by 160
Self-citationIsomorphism testing for graphs of bounded genus
Miller, G. L. (1980) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800141.804670 · Cited by 148
Some NP-Complete Problems Similar to Graph Isomorphism
Lubiw, A. (1981) · SIAM Journal on Computing · doi:10.1137/0210002 · Cited by 144
Cited by
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
Babai, L., & Moran, S. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90028-1 · Cited by 589
Self-citationAn optimal lower bound on the number of variables for graph identification
Cai, J.-Y., F�rer, M., & Immerman, N. (1992) · Combinatorica · doi:10.1007/bf01305232 · Cited by 502
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
Kuperberg, G. (2005) · SIAM Journal on Computing · doi:10.1137/s0097539703436345 · Cited by 347
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
Klivans, A. R., & van Melkebeek, D. (2002) · SIAM Journal on Computing · doi:10.1137/s0097539700389652 · Cited by 270
Metadata
- Authors
- Babai, L., & Luks, E. M.
- Venue
- Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83
- Publisher
- ACM Press
- Published
- 1983
- Pages
- 171-183
- OpenAlex
- W1973322735
- Cited by
- 410
- References
- 12
- FWCI
- 3.22
- Type
- conference paper
- Language
- en
- Open access
- gold
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: Canonical labeling of graphs. https://app.cochat.ai/papers/10.1145/800061.808746
- The paper
- Babai, L., & Luks, E. M. (1983). Canonical labeling of graphs. Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83. https://doi.org/10.1145/800061.808746
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.