The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$ (Q2958104): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-48532-4_19
+Normal rank
@@ Property / OpenAlex ID @@
+W2549539770
@@ Property / OpenAlex ID: W2549539770 / rank @@
+Normal rank
@@ Property / cites work @@
+On the chromatic number of circulant graphs
@@ Property / cites work: On the chromatic number of circulant graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The set chromatic number of a graph
@@ Property / cites work: The set chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+The sigma chromatic number of a graph
@@ Property / cites work: The sigma chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness results and spectral techniques for combinatorial problems on circulant graphs
+Normal rank
@@ Property / cites work @@
+Lucky labelings of graphs
@@ Property / cites work: Lucky labelings of 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
@@ links / mardi / name / links / mardi / name @@
+Publication:2958104