"2-Colorable Perfect Matching is NP-complete in 2-Connected 3-Regular ..."

Erik D. Demaine, Kritkorn Karntikoon, Nipun Pitimanaaree (2023)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2309.09786

access: open

type: Informal or Other Publication

metadata version: 2023-09-22

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2309-09786
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2309-09786
Erik D. Demaine, Kritkorn Karntikoon, Nipun Pitimanaaree:
2-Colorable Perfect Matching is NP-complete in 2-Connected 3-Regular Planar Graphs. CoRR abs/2309.09786 (2023)

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.