Domatic partitions of computable graphs (Q2436619): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00153-013-0359-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2011539887
@@ Property / OpenAlex ID: W2011539887 / rank @@
+Normal rank
@@ Property / cites work @@
+Effective coloration
@@ Property / cites work: Effective coloration / rank @@
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4249726
@@ Property / cites work: Q4249726 / rank @@
+Normal rank
@@ Property / cites work @@
+Reverse Mathematics and Recursive Graph Theory
@@ Property / cites work: Reverse Mathematics and Recursive Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian paths in infinite graphs
@@ Property / cites work: Hamiltonian paths in infinite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Infinite versions of some problems from finite complexity theory
+Normal rank
@@ Property / cites work @@
+Complexity of the exact domatic number problem and of the exact conveyor flow shop problem
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3395521
@@ Property / cites work: Q3395521 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040892
@@ Property / cites work: Q4040892 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3663328
@@ Property / cites work: Q3663328 / rank @@
+Normal rank