Bounds for the chromatic number of a graph

Article Properties
Refrences
Title Journal Journal Categories Citations Publication Date
An Inequality for the Chromatic Number of a Graph 1968
An upper bound for the chromatic number of a graph and its application to timetabling problems The Computer Journal
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • 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
 270 1967
On Complementary Graphs The American Mathematical Monthly
  • Science: Mathematics
 235 1956
Refrences Analysis
Category Category Repetition
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware2
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software2
Science: Mathematics: Instruments and machines: Electronic computers. Computer science2
Science: Mathematics1
Science: Science (General): Cybernetics: Information theory1
The category Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware 2 is the most frequently represented among the references in this article. It primarily includes studies from The American Mathematical Monthly and The Computer Journal. The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year