Fix docstring

Author: gdalle

src/order.jl

@@ -305,10 +305,10 @@ const DynamicLargestFirst = DynamicDegreeBasedOrder{:forward,:low2high}
 """
     PerfectEliminationOrder
 
-Instance of [`AbstractOrder`](@ref) which computes a perfect elimination ordering when the underlying graph is [chordal](https://en.wikipedia.org/wiki/Chordal_graph). For generic graphs, it computes a suboptimal ordering.
+Instance of [`AbstractOrder`](@ref) which computes a perfect elimination ordering when the underlying graph is [chordal](https://en.wikipedia.org/wiki/Chordal_graph). For non-chordal graphs, it computes a suboptimal ordering.
 
 !!! warning
-    This order can only be applied for symmetric or bidirectional coloring problems. Furthermore, its optimality guarantees only hold for decompression by substitution, not for direct decompression.
+    This order can only be applied for symmetric or bidirectional coloring problems.
 
 !!! danger
     This order is implemented as a package extension and requires loading [CliqueTrees.jl](https://github.com/AlgebraicJulia/CliqueTrees.jl).