Graph Coloring and Reverse Mathematics

DOI10.1002/1521-3870(200010)46:4%3C543::AID-MALQ543%3E3.0.CO;2-EMaRDI QIDQ4521128zbMATH OpenOpenAlexFDO

Authors James H. Schmerl

Publication date 25 February 2001

Full work available at URL https://doi.org/10.1002/1521-3870(200010)46:4%3C543::aid-malq543%3E3.0.co;2-e

zbMATH Keywords

computable inseparabilitygraph coloringrecursive inseparabilityreverse mathematics

Mathematics Subject Classification ID

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

Recommendations

• Reverse mathematics and the coloring number of graphs
• Reverse mathematics and colorings of hypergraphs
• Reverse Mathematics and Recursive Graph Theory
• Reverse mathematics and a Ramsey-type König's lemma
• The strength of Ramsey's theorem for pairs over trees. I: Weak König's lemma

Cited in

(8)

• Reverse mathematics and colorings of hypergraphs
• On universal positive graphs
• Comparing the strength of diagonally nonrecursive functions in the absence of _2⁰ induction
• Reverse mathematics and Grundy colorings of graphs
• Reverse Mathematics and Recursive Graph Theory
• Comparing DNR and WWKL
• scientific article; zbMATH DE number 2236643 (Why is no real title available?)
• Reverse mathematics and the coloring number of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4521128)