Recursive Colorings of Graphs

DOI10.4153/CJM-1980-062-7MaRDI QIDQ4175305zbMATH OpenOpenAlexFDO

Authors James H. Schmerl

Publication date 1980

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/cjm-1980-062-7

zbMATH Keywords

Highly Recursive GraphsRecursive Colorings of Graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited in

(14)

• On the strength of König's duality theorem for infinite bipartite graphs
• On the finiteness of the recursive chromatic number
• On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
• R.e. Prime powers and total rigidity
• Reverse Mathematics and Recursive Graph Theory
• Feasible Graphs and Colorings
• Computing planarity in computable planar graphs
• Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
• Primitive recursive reverse mathematics
• Periodic colorings and orientations in infinite graphs
• Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
• Finding domatic partitions in infinite graphs
• \(A\)-computable graphs
• On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case

This page was built for publication: Recursive Colorings of Graphs

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