The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 28
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled
On the Structure of Polynomial Time Reducibility and was published in 1975. The most recent citation comes from a 2022 study titled
Exact algorithms for counting 3-colorings of graphs. This article reached its peak citation in 2009, with 4 citations. It has been cited in 32 different journals,
6% of which are open access. Among related journals, the
Discrete Applied Mathematics cited this research the most, with 5 citations. The chart below illustrates the annual citation trends for this article.