Graph Coloring and Reverse Mathematics

DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200010)46:4<543::AID-MALQ543>3.0.CO;2-E" /><543::AID-MALQ543>3.0.CO;2-E 10.1002/1521-3870(200010)46:4<543::AID-MALQ543>3.0.CO;2-EzbMath0963.03079OpenAlexW2004399813MaRDI QIDQ4521128

James H. Schmerl

Publication date: 25 February 2001

Full work available at URL: https://doi.org/10.1002/1521-3870(200010)46:4<543::aid-malq543>3.0.co;2-e

zbMATH Keywords

graph coloringreverse mathematicsrecursive inseparabilitycomputable inseparability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Second- and higher-order arithmetic and fragments (03F35) Theory of numerations, effectively presented structures (03D45)

Related Items (2)

On universal positive graphs ⋮ COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF INDUCTION

This page was built for publication: Graph Coloring and Reverse Mathematics