Feasible Graphs and Colorings

This publication has 13 references indexed in Scilit:

• Recursively presented games and strategies
  Mathematical Social Sciences, 1992
• Polynomial-time abelian groups
  Annals of Pure and Applied Logic, 1992
• Polynomial-time versus recursive models
  Annals of Pure and Applied Logic, 1991
• When is every recursive linear ordering of type μ recursively isomorphic to a polynomial time linear ordering over the natural numbers in binary form?
  Published by Springer Nature ,1990
• The Effective Version of Brooks' Theorem
  Canadian Journal of Mathematics, 1982
• Recursive Colorings of Highly Recursive Graphs
  Canadian Journal of Mathematics, 1981
• Recursive Colorings of Graphs
  Canadian Journal of Mathematics, 1980
• Effective coloration
  The Journal of Symbolic Logic, 1976
• Degrees of members of Π₁⁰classes
  Pacific Journal of Mathematics, 1972
• On colouring the nodes of a network
  Mathematical Proceedings of the Cambridge Philosophical Society, 1941