1. Good edge-labelling of graphs;Araújo;Discrete Appl. Math.,2012
2. Vertex partitioning problems on graphs with bounded tree width;Aravind;Discrete Appl. Math.,2022
3. An FPT algorithm for Matching Cut and d-Cut;Aravind,2021
4. Cutting Barnette graphs perfectly is hard;Bonnet,2023
5. The complexity of the Matching-Cut problem for planar graphs and other graph classes;Bonsma;J. Graph Theory,2009