BibTeX record journals/tcs/SkovieraV24

download as .bib file

@article{DBLP:journals/tcs/SkovieraV24,
  author       = {Martin Skoviera and
                  Peter Varsa},
  title        = {Deciding whether four perfect matchings can cover the edges of a snark
                  is NP-complete},
  journal      = {Theor. Comput. Sci.},
  volume       = {988},
  pages        = {114374},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114374},
  doi          = {10.1016/J.TCS.2023.114374},
  timestamp    = {Sat, 18 May 2024 23:55:17 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/SkovieraV24.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.