Recursion Theoretic Aspects of Graphs and Orders

James H. Schmerl

Type: Book-Chapter

Publication Date: 1985-01-01

Citations: 5

DOI: https://doi.org/10.1007/978-94-009-5315-4_13

Similar Works

Action	Title	Year	Authors
+	Graph structures and well-quasi-ordering	2014	Chun‐Hung Liu
+ PDF Chat	Combinatorics and Graph Theory	1981	A Dold Beno Eckmann S. Koteswara Rao Bhaskara Siddani
+	Combinatorics and Graph Theory	1993
+	Combinatorics and graph theory	2001
+	Combinatorics and Graph Theory	2018	Samandeep Singh
+	Combinatorics and Graph Theory	1996	Darren Redfern
+	Characteristics and regularities of graphs and words	2014	Michalis Christou
+	On a graph theoretical basis for ordering of structures	1979	Milan Randić Charles L. Wilkins
+	Combinatorics with emphasis on the theory of graphs	1979	Hartmut Noltemeier
+	Succinct definitions in the first order theory of graphs	2005	Oleg Pikhurko Joel Spencer Oleg Verbitsky
+ PDF Chat	Algebraic combinatorics on order of trees	2015	Grégory Châtel
+	Trees and circle orders	2017	William T. Trotter
+	Trees, subtrees and order types	1981	Stevo Todorčević
+	Directions in infinite graph theory and combinatorics	1992	Reinhard Diestel
+	Combinatorial aspects of relations	1984	Stephen D. Comer
+	Algebraic structures on graphs	1983	Paulo Ribenboim
+	Tree-depth of Graphs: Characterisations and Obstructions	2009	Archontia C. Giannopoulou
+	Introductory Combinatorics and Graph Theory	2004	Joseph DeMaio Virginia R. Watson
+ PDF Chat	Logical complexity of graphs: A survey	2011	Oleg Pikhurko Oleg Verbitsky
+ PDF Chat	Normal tree orders for infinite graphs	1994	J.‐M. Brochet Reinhard Diestel

Action	Title	Year	Authors
+ PDF Chat	χ‐bounded families of oriented graphs	2018	Pierre Aboulker Jørgen Bang‐Jensen Nicolás Bousquet Pierre Charbit Frédéric Havet Frédéric Maffray Javier Zamora
+	Applications of hypergraph coloring to coloring graphs not inducing certain trees	1996	H. A. Kierstead V. Rödl

Action	Title	Year	Authors
+	A Mathematical Incompleteness in Peano Arithmetic	1977	J. B. Paris
+ PDF Chat	An effective version of Dilworth’s theorem	1981	Henry A. Kiersteád
+	Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)	1972	Alfred B. Manaster Joseph G. Rosenstein
+	Decidability and ℵ<sub>0</sub>-categoricity of theories of partially ordered sets	1980	James H. Schmerl
+	Ramsey's theorem and recursion theory	1972	Carl G. Jockusch
+	Effective coloration	1976	Dwight R. Bean