On a construction of critical graphs which are not sensitive
Let G be a graph and L(G) be the closed-set lattice of G. In the paper it is shown that if a graph G has property \(L(G)\simeq L(G')\Rightarrow G\simeq G'\) then it holds L(G)\(\not\simeq L(G-e)\), for every edge e of G, and \(L(G)\not\simeq L(G+e)\), for every edge e of G, but there are examples that the reverse implication is not true.
scientific article; zbMATH DE number 3918413