On the Computation of the Competition Number of a Graph

This publication has 8 references indexed in Scilit:

• Computing the boxicity of a graph by covering its complement by cointerval graphs
  Discrete Applied Mathematics, 1983
• A characterization of robert's inequality for boxicity
  Discrete Mathematics, 1979
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
  Communications of the ACM, 1978
• Food webs, competition graphs, and the boxicity of ecological phase space
  Lecture Notes in Mathematics, 1978
• Food webs and the dimensionality of trophic niche space
  Proceedings of the National Academy of Sciences, 1977
• Contentment in graph theory: Covering graphs with cliques
  Indagationes Mathematicae, 1977
• GRAPH THEORY
  Published by Defense Technical Information Center (DTIC) ,1969
• A Model of Simple Competition
  Published by Harvard University Press ,1966