Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Kritkorn Karntikoon, and Nipun Pitimanaaree, “2-Colorable Perfect Matching is NP-complete in 2-Connected 3-Regular Planar Graphs”, Theory of Computing Systems, volume 69, number 2, 2025, pages 22.

BibTeX

@Article{TwoColorMatching_TheoryComputSys,
  AUTHOR        = {Erik D. Demaine and Kritkorn Karntikoon and Nipun Pitimanaaree},
  TITLE         = {2-Colorable Perfect Matching is {NP}-complete in 2-Connected 3-Regular Planar Graphs},
  JOURNAL       = {Theory of Computing Systems},
  journalurl    = {https://link.springer.com/journal/224},
  VOLUME        = 69,
  NUMBER        = 2,
  YEAR          = 2025,
  PAGES         = {22},

  withstudent   = 1,
  doi           = {https://dx.doi.org/10.1007/s00224-025-10221-2},
  dblp          = {https://dblp.org/rec/journals/mst/DemaineKP25},
  comments      = {This paper is also available from <A HREF="https://doi.org/10.1007/s00224-025-10221-2">SpringerLink</A>.},
}

Comments:

This paper is also available from SpringerLink.

Availability:

Currently unavailable. If you are in a rush for copies, contact me.

[Google Scholar search]