On the complexity of finding the chromatic number of a recursive graph II: the unbounded case

&
Annals of Pure and Applied Logic 45 (3):227-246 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(89)90037-7

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,709

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On the complexity of finding the chromatic number of a recursive graph I: the bounded case.Richard Beigel & William I. Gasarch - 1989 - Annals of Pure and Applied Logic 45 (1):1-38.
Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.
Measurable chromatic numbers.Benjamin D. Miller - 2008 - Journal of Symbolic Logic 73 (4):1139-1157.
Generic graph construction.James E. Baumgartner - 1984 - Journal of Symbolic Logic 49 (1):234-240.
Weak Borel chromatic numbers.Stefan Geschke - 2011 - Mathematical Logic Quarterly 57 (1):5-13.
On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
Wild edge colourings of graphs.Mirna Džamonja, Péter Komjáth & Charles Morgan - 2004 - Journal of Symbolic Logic 69 (1):255 - 264.
Strongly representable atom structures of cylindric algebras.Robin Hirsch & Ian Hodkinson - 2009 - Journal of Symbolic Logic 74 (3):811-828.
Reverse Mathematics and Recursive Graph Theory.William Gasarch & Jeffry L. Hirst - 1998 - Mathematical Logic Quarterly 44 (4):465-473.
Correlations entre complexification et instabilite dans une formalisation du concept de complexite.F. Collot - 1995 - Acta Biotheoretica 43 (1-2):195-204.
Using d-separation to calculate zero partial correlations in linear models with correlated errors.Peter Spirtes, Thomas Richardson, Christopher Meek, Richard Scheines & Clark Glymour - unknown
Max and min limiters.James Owings, William Gasarch & Georgia Martin - 2002 - Archive for Mathematical Logic 41 (5):483-495.
A Conceptual Graph approach to the Generation of Referring Expressions.Madalina Croitoru - unknown
Structured Pigeonhole Principle, Search Problems and Hard Tautologies.Jan Krajíček - 2005 - Journal of Symbolic Logic 70 (2):619 - 630.
Groupwise density cannot be much bigger than the unbounded number.Saharon Shelah - 2008 - Mathematical Logic Quarterly 54 (4):340-344.

Analytics

Added to PP
2014-01-16

Downloads
23 (#678,765)

6 months
7 (#420,337)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Index sets for Π01 classes.Douglas Cenzer & Jeffrey Remmel - 1998 - Annals of Pure and Applied Logic 93 (1-3):3-61.
Nondeterministic bounded query reducibilities.Richard Beigel, William Gasarch & Jim Owings - 1989 - Annals of Pure and Applied Logic 41 (2):107-118.
Index sets for< i> Π_< sup> 0< sub> 1 classes.Douglas Cenzer & Jeffrey Remmel - 1998 - Annals of Pure and Applied Logic 93 (1):3-61.

Add more citations

References found in this work

Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.
Recursive coloration of countable graphs.Hans-Georg Carstens & Peter Päppinghaus - 1983 - Annals of Pure and Applied Logic 25 (1):19-45.

Add more references