gh-38214: test that #38159 is fixed
    
This will fix #38159

Add a missing test

### 📝 Checklist

<!-- Put an `x` in all the boxes that apply. -->

- [ x] The title is concise and informative.
- [ x] The description explains in detail what this PR is about.
- [ x] I have linked a relevant issue or discussion.
- [ x] I have created tests covering the changes.
- [  ] I have updated the documentation and checked the documentation
preview.

### ⌛ Dependencies

<!-- List all open PRs that this PR logically depends on. For example,
-->
<!-- - #12345: short description why this is a dependency -->
#38163
    
URL: #38214
Reported by: Dima Pasechnik
Reviewer(s): David Coudert

Author: Release Manager

src/sage/graphs/graph_decompositions/tree_decomposition.pyx

@@ -87,7 +87,6 @@ The treewidth of a clique is `n-1` and its treelength is 1::
 
     - Approximation of treelength based on :meth:`~sage.graphs.graph.Graph.lex_M`
     - Approximation of treelength based on BFS Layering
-    - upgrade tdlib to 0.9.0 :issue:`30813`
 
 
 Methods
@@ -618,6 +617,12 @@ def treewidth(g, k=None, kmin=None, certificate=False, algorithm=None, nice=Fals
         sage: g.treewidth(algorithm='sage', certificate=True, kmin=4)
         Tree decomposition: Graph on 4 vertices
 
+    Check that :issue:`38159` is fixed ::
+
+        sage: G = Graph('I~~}vPlr_')
+        sage: G.treewidth(algorithm='sage') == G.treewidth(algorithm='tdlib')  # optional - tdlib
+        True
+
     Trivially true::
 
         sage: graphs.PetersenGraph().treewidth(k=35)