For the first, I would expect https://en.m.wikipedia.org/wiki/Graph_isomorphism (different from https://en.m.wikipedia.org/wiki/Graph_isomorphism_problem) is simple enough for laymen, as long as they know what a graph is.
For the second, I would think https://en.m.wikipedia.org/wiki/Quasi-polynomial_time#Quasi-... could give just enough rope to climb out of the pit you are in.
Two graphs are isomorphic if they are "the same" graph, as in, if you renamed the edges, the graph would be the same.
For example, if you have the graphs:
G1: A -> B <-> C G1: C -> B <-> A
The only difference between those graphs is the name of the vertices. If you rename them, you get exactly the same graph back.
The first example from the wikipedia page seems like a nice one: https://en.wikipedia.org/wiki/Graph_isomorphism
While the two graphs look different, they are exactly the same.
Quasi-polynomial algorithms, as the name implies, are algorithms that are "almost-polynomial" (ie. slower than polynomial, but faster than exponential). According to https://en.wikipedia.org/wiki/Time_complexity#Quasi-polynomi..., the worst case for a quasi-polynomial algorithm is 2^O(log (n)^c).