BibTeX record journals/tcs/LacroixMMP12

download as .bib file

@article{DBLP:journals/tcs/LacroixMMP12,
  author       = {Mathieu Lacroix and
                  Ali Ridha Mahjoub and
                  S{\'{e}}bastien Martin and
                  Christophe Picouleau},
  title        = {On the NP-completeness of the perfect matching free subgraph problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {423},
  pages        = {25--29},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2011.12.065},
  doi          = {10.1016/J.TCS.2011.12.065},
  timestamp    = {Fri, 09 Apr 2021 18:27:57 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/LacroixMMP12.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.