Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle (Q1025926): Difference between revisions

@@ Property / cites work @@
+Q4187840
@@ Property / cites work: Q4187840 / rank @@
+Normal rank
@@ Property / cites work @@
+On chromatic equivalence of graphs
@@ Property / cites work: On chromatic equivalence of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the chromaticity of some 2-connected \((n,n+3)\)-graphs
+Normal rank
@@ Property / cites work @@
+Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles
+Normal rank
@@ Property / cites work @@
+Chromatic uniqueness of the generalized \(\Theta\)-graph
+Normal rank
@@ Property / cites work @@
+Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles.
+Normal rank
@@ Property / cites work @@
+Q4000770
@@ Property / cites work: Q4000770 / rank @@
+Normal rank
@@ Property / cites work @@
+Cutpoints and the chromatic polynomial
@@ Property / cites work: Cutpoints and the chromatic polynomial / rank @@
+Normal rank
@@ Property / cites work @@
+Q5790850
@@ Property / cites work: Q5790850 / rank @@
+Normal rank