The chromatic equivalence class of \(K_{1, n, n + 2}\) (Q2514152): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2014.12.013
+Normal rank
@@ Property / OpenAlex ID @@
+W1991070701
@@ Property / OpenAlex ID: W1991070701 / rank @@
+Normal rank
@@ Property / cites work @@
+On maximally saturated graphs
@@ Property / cites work: On maximally saturated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3990580
@@ Property / cites work: Q3990580 / rank @@
+Normal rank
@@ Property / cites work @@
+Chromatic equivalence classes of complete tripartite graphs
+Normal rank
@@ Property / cites work @@
+Chromatic equivalence classes of complete tripartite graphs
+Normal rank
@@ Property / cites work @@
+On chromatic uniqueness of two infinite families of graphs
+Normal rank
@@ Property / cites work @@
+Q5313291
@@ Property / cites work: Q5313291 / rank @@
+Normal rank
@@ Property / cites work @@
+On chromatic coefficients
@@ Property / cites work: On chromatic coefficients / rank @@
+Normal rank
@@ Property / cites work @@
+Chromatic uniqueness of certain complete tripartite graphs
+Normal rank
@@ Property / cites work @@
+Q3014375
@@ Property / cites work: Q3014375 / rank @@
+Normal rank
@@ Property / cites work @@
+The chromaticity of complete bipartite graphs with at most one edge deleted
+Normal rank
@@ Property / cites work @@
+The number of shortest cycles and the chromatic uniqueness of a graph
+Normal rank
@@ Property / cites work @@
+Chromaticity of two-trees
@@ Property / cites work: Chromaticity of two-trees / rank @@
+Normal rank