@InProceedings{lucke_et_al:LIPIcs.MFCS.2023.64,
  author =	{Lucke, Felicia and Paulusma, Dani\"{e}l and Ries, Bernard},
  title =	{{Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius}},
  booktitle =	{48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)},
  pages =	{64:1--64:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-292-1},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{272},
  editor =	{Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.64},
  URN =		{urn:nbn:de:0030-drops-185981},
  doi =		{10.4230/LIPIcs.MFCS.2023.64},
  annote =	{Keywords: matching cut, perfect matching, H-free graph, diameter, radius, dichotomy}
}