Distance graphs with maximum chromatic number (Q2476275): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2083949378
@@ Property / OpenAlex ID: W2083949378 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4351316
@@ Property / cites work: Q4351316 / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness results and spectral techniques for combinatorial problems on circulant graphs
+Normal rank
@@ Property / cites work @@
+The chromatic numbers of distance graphs
@@ Property / cites work: The chromatic numbers of distance graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring the real line
@@ Property / cites work: Colouring the real line / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring prime distance graphs
@@ Property / cites work: Colouring prime distance graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On planarity and colorability of circulant graphs
@@ Property / cites work: On planarity and colorability of circulant graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4329050
@@ Property / cites work: Q4329050 / rank @@
+Normal rank
@@ Property / cites work @@
+Chromatic numbers of integer distance graphs
@@ Property / cites work: Chromatic numbers of integer distance graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fractional chromatic number and circular chromatic number for distance graphs with large clique size
+Normal rank
@@ Property / cites work @@
+Distance graphs with finite chromatic number
@@ Property / cites work: Distance graphs with finite chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Q2760982
@@ Property / cites work: Q2760982 / rank @@
+Normal rank
@@ Property / cites work @@
+-colorable 6-regular toroidal graphs.
@@ Property / cites work: 4-colorable 6-regular toroidal graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Circular chromatic number of distance graphs with distance sets of cardinality 3
+Normal rank