M.Y.
Reputation
Next privilege 100 Rep.
Edit community wikis
 Feb4 awarded Nice Question Apr10 awarded Supporter Apr10 accepted Determining whether two k-chromatic graphs are equivalent (not simply isomorphic) using IsomorphicGraphQ? Apr10 comment Is it possible for me to explicitly specify a point list for SpatialGraphDistribution? @Szabolcs I think you're answer is the answer I was looking for - it can't be done, so I have to rely on my own implementation. Apr10 accepted Is it possible for me to explicitly specify a point list for SpatialGraphDistribution? Apr10 comment Is it possible for me to explicitly specify a point list for SpatialGraphDistribution? @Szabolcs Oh, no I'm just asking to be able to feed a set of points to SpatialGraphDistribution that I've already generated by simulating Random Sequential Adsorption (RSA). My understanding, from the literature, is that this random packing process must be simulated. Apr9 awarded Editor Apr9 revised Is it possible for me to explicitly specify a point list for SpatialGraphDistribution? added 353 characters in body Apr9 comment Determining whether two k-chromatic graphs are equivalent (not simply isomorphic) using IsomorphicGraphQ? @Szabolcs Thanks - good to know that IsomorphicGraphQ doesn't return "False" if it times out. Apr9 comment Determining whether two k-chromatic graphs are equivalent (not simply isomorphic) using IsomorphicGraphQ? @DanielLichtblau Please feel free to write your response as an answer so that I may accept it. Apr9 asked Is it possible for me to explicitly specify a point list for SpatialGraphDistribution? Apr9 comment Determining whether two k-chromatic graphs are equivalent (not simply isomorphic) using IsomorphicGraphQ? @DanielLichtblau I believe it's true that your answer is the best one can do without additional guarantees about the structure of $G_1$ and $G_2$. Apr9 asked Determining whether two k-chromatic graphs are equivalent (not simply isomorphic) using IsomorphicGraphQ? Apr9 awarded Scholar Apr9 comment Determining whether two $k$-chromatic graphs are isomorphic (respecting vertex coloration) @whuber Sorry for the delay in responding, but this is a fantastic answer! Apr9 accepted Determining whether two $k$-chromatic graphs are isomorphic (respecting vertex coloration) Apr6 awarded Student Apr6 asked Determining whether two $k$-chromatic graphs are isomorphic (respecting vertex coloration)