BibTeX record journals/corr/abs-2204-07129

download as .bib file

@article{DBLP:journals/corr/abs-2204-07129,
  author       = {Felicia Lucke and
                  Dani{\"{e}}l Paulusma and
                  Bernard Ries},
  title        = {On The Complexity of Matching Cut for Graphs of Bounded Radius and
                  H-Free Graphs},
  journal      = {CoRR},
  volume       = {abs/2204.07129},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2204.07129},
  doi          = {10.48550/ARXIV.2204.07129},
  eprinttype    = {arXiv},
  eprint       = {2204.07129},
  timestamp    = {Mon, 26 Jun 2023 20:50:14 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2204-07129.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.