Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!pacific.mps.ohio-state.edu!linac!att!ucbvax!DOSUNI1.BITNET!DUENTSCH
From: DUENTSCH@DOSUNI1.BITNET (Ivo Duentsch)
Newsgroups: comp.theory
Subject: Rigid graphs
Message-ID: <9104291709.AA03753@irt.watson.ibm.com>
Date: 29 Apr 91 17:09:26 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: Ivo Duentsch <DUENTSCH%DOSUNI1.BITNET@VM1.NoDak.EDU>
Lines: 8

What is the current state of knowledge on the complexity of recognizing
rigidness of a graph, or on its state relative to graph (non-) isomorphism?
Is there any literature on this?
Any information will be much appreciated.

Thanks.

Ivo Duentsch, duentsch@dosuni1.bitnet