Describing Graphs: A First-Order Approach to Graph Canonization
- 1 January 1990
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Expressibility and Parallel ComplexitySIAM Journal on Computing, 1989
- Descriptive and computational complexityProceedings of Symposia in Applied Mathematics, 1989
- Nondeterministic Space is Closed under ComplementationSIAM Journal on Computing, 1988
- Languages that Capture Complexity ClassesSIAM Journal on Computing, 1987
- Relational queries computable in polynomial timeInformation and Control, 1986
- Group-Theoretic Algorithms and Graph IsomorphismLecture Notes in Computer Science, 1982
- On Moschovakis closure ordinalsThe Journal of Symbolic Logic, 1977
- Probabilities on finite modelsThe Journal of Symbolic Logic, 1976
- Isomorphism of Planar Graphs (Working Paper)Published by Springer Nature ,1972
- An application of games to the completeness problem for formalized theoriesFundamenta Mathematicae, 1960