Domatic partitions of computable graphs
From MaRDI portal
Publication:2436619
DOI10.1007/s00153-013-0359-2zbMath1348.03040MaRDI QIDQ2436619
Tyler Markkanen, Matthew Jura, Oscar Levin
Publication date: 25 February 2014
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-013-0359-2
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
03B30: Foundations of classical theories (including reverse mathematics)
03F35: Second- and higher-order arithmetic and fragments
03D45: Theory of numerations, effectively presented structures
05C63: Infinite graphs
Related Items
Computing planarity in computable planar graphs, Finding domatic partitions in infinite graphs, \(A\)-computable graphs
Cites Work
- Hamiltonian paths in infinite graphs
- Infinite versions of some problems from finite complexity theory
- Complexity of the exact domatic number problem and of the exact conveyor flow shop problem
- Effective coloration
- Reverse Mathematics and Recursive Graph Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item