added tight_cut_decomposition() to todo list

Author: janmenjayap

src/sage/graphs/matching_covered_graph.py

@@ -97,6 +97,7 @@
         ``number_of_braces()`` | Return the number of braces.
         ``number_of_bricks()`` | Return the number of bricks.
         ``number_of_petersen_bricks()`` | Return the number of Petersen bricks.
+        ``tight_cut_decomposition()`` | Return a maximal set of laminar nontrivial tight cuts and a corresponding vertex set partition.
 
     **Removability and ear decomposition**
 
@@ -2983,7 +2984,6 @@ def is_brick(self, coNP_certificate=False):
             - :meth:`~sage.graphs.matching_covered_graph.MatchingCoveredGraph.bricks_and_braces`
             - :meth:`~sage.graphs.matching_covered_graph.MatchingCoveredGraph.number_of_bricks`
             - :meth:`~sage.graphs.matching_covered_graph.MatchingCoveredGraph.number_of_petersen_bricks`
-            - :meth:`~sage.graphs.matching_covered_graph.MatchingCoveredGraph.tight_cut_decomposition`
         """
         if self.is_bipartite():
             raise ValueError('the input graph is bipartite')
@@ -3401,14 +3401,6 @@ def remove_loops(self, vertices=None):
 
         return
 
-    @doc_index('Bricks, braces and tight cut decomposition')
-    def tight_cut_decomposition(self):
-        r"""
-        Return a maximal set of laminar nontrivial tight cuts and a
-        corresponding vertex set partition.
-        """
-        raise NotImplementedError()
-
     @doc_index('Miscellaneous methods')
     def update_matching(self, matching):
         r"""