Planar 3-colorability is polynomial complete

Article Properties
  • Language
    English
  • Publication Date
    1973/07/01
  • Journal
  • Indian UGC (journal)
  • Refrences
    2
  • Citations
    55
  • Larry Stockmeyer Massachusetts Institute of Technology, Cambridge, Massachusetts
Refrences
Title Journal Journal Categories Citations Publication Date
The Theory of Graphs and Its Applications 1962
Complexity of Computer Computations
Citations
Title Journal Journal Categories Citations Publication Date
Parameterized analysis and crossing minimization problems Computer Science Review
  • Science: Science (General): Cybernetics: Information theory
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2022
Exact algorithms for counting 3-colorings of graphs Discrete Applied Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Technology: Engineering (General). Civil engineering (General)
2022
On the probe problem for (r,ℓ)-well-coveredness: Algorithms and complexity Theoretical Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2 2022
An exploration of combinatorial testing-based approaches to fault localization for explainable AI Annals of Mathematics and Artificial Intelligence
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
2021
The envy-free matching problem with pairwise preferences Information Processing Letters
  • Technology: Technology (General): Industrial engineering. Management engineering: Information technology
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication
  • Science: Science (General): Cybernetics: Information theory
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
1 2021
Citations Analysis
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.
Citations used this article by year