%0 Journal Article %1 journals/tcs/LuckePR22 %A Lucke, Felicia %A Paulusma, Daniël %A Ries, Bernard %D 2022 %J Theor. Comput. Sci. %K dblp %P 33-42 %T On the complexity of matching cut for graphs of bounded radius and H-free graphs. %U http://dblp.uni-trier.de/db/journals/tcs/tcs936.html#LuckePR22 %V 936

@article{journals/tcs/LuckePR22, added-at = {2024-06-08T00:00:00.000+0200}, author = {Lucke, Felicia and Paulusma, Daniël and Ries, Bernard}, biburl = {https://www.bibsonomy.org/bibtex/2f8825780e452f352e11805c527c2e904/dblp}, ee = {https://doi.org/10.1016/j.tcs.2022.09.014}, interhash = {0837980e3c1061c0473776da8c46e261}, intrahash = {f8825780e452f352e11805c527c2e904}, journal = {Theor. Comput. Sci.}, keywords = {dblp}, pages = {33-42}, timestamp = {2024-06-17T07:09:46.000+0200}, title = {On the complexity of matching cut for graphs of bounded radius and H-free graphs.}, url = {http://dblp.uni-trier.de/db/journals/tcs/tcs936.html#LuckePR22}, volume = 936, year = 2022 }