ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
16
views
13
references
Top references
cited by
69
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
815
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
An optimal lower bound on the number of variables for graph identification
Author(s):
Jin-Yi Cai
,
Martin F�rer
,
Neil Immerman
Publication date
Created:
December 1992
Publication date
(Print):
December 1992
Journal:
Combinatorica
Publisher:
Springer Nature
Read this article at
ScienceOpen
Publisher
Review
Review article
Invite someone to review
Bookmark
Cite as...
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Abstract
Related collections
Exponential Random Graph Models
Most cited references
13
Record
: found
Abstract
: not found
Article
: not found
The graph isomorphism disease
Ronald Read
,
Derek G. Corneil
(1978)
0
comments
Cited
57
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Relational queries computable in polynomial time
Neil Immerman
(1986)
0
comments
Cited
48
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Languages that Capture Complexity Classes
Neil Immerman
(1987)
0
comments
Cited
46
times
– based on
0
reviews
Review now
Bookmark
All references
Author and article information
Journal
Title:
Combinatorica
Abbreviated Title:
Combinatorica
Publisher:
Springer Nature
ISSN (Print):
0209-9683
ISSN (Electronic):
1439-6912
Publication date Created:
December 1992
Publication date (Print):
December 1992
Volume
: 12
Issue
: 4
Pages
: 389-410
Article
DOI:
10.1007/BF01305232
SO-VID:
8d1bfc6c-55b9-4521-b689-35215b755384
Copyright ©
© 1992
History
Data availability:
Comments
Comment on this article
Sign in to comment
scite_
Similar content
815
Vizing-Goldberg type bounds for the equitable chromatic number of block graphs
Authors:
Janusz Dybizbański
,
Hanna Furmańczyk
,
Vahan Mkrtchyan
Efficient Bayesian experimentation using an expected information gain lower bound
Authors:
,
,
Heuristic search for scheduling flexible manufacturing systems using lower bound reachability matrix
Authors:
Jonghyun Lee
,
Jin S Lee
See all similar
Cited by
69
On the Decision Problem for Two-Variable First-Order Logic
Authors:
Moshe Vardi
,
Erich Grädel
,
Phokion Kolaitis
Predicting molecular properties with covariant compositional networks
Authors:
Brandon Anderson
,
Risi Kondor
,
Truong Hy
…
On polynomial time computation over unordered structures
Authors:
Andreas Blass
,
Yuri Gurevich
,
Saharon Shelah
See all cited by
Most referenced authors
28
E Lander
M. P. R. de S.
P Erdõs
See all reference authors