An infinite family of 2-connected graphs that have reliability factorisations (Q730493): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2016.11.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2559822349
@@ Property / OpenAlex ID: W2559822349 / rank @@
+Normal rank
@@ Property / cites work @@
+Chromatic polynomials of complements of bipartite graphs
+Normal rank
@@ Property / cites work @@
+Q3789615
@@ Property / cites work: Q3789615 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3447278
@@ Property / cites work: Q3447278 / rank @@
+Normal rank
@@ Property / cites work @@
+Certificates for properties of stability polynomials of graphs
+Normal rank
@@ Property / cites work @@
+Certificates of factorisation for chromatic polynomials
+Normal rank
@@ Property / cites work @@
+Certificates of factorisation for a class of triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Non-bipartite chromatic factors
@@ Property / cites work: Non-bipartite chromatic factors / rank @@
+Normal rank
@@ Property / cites work @@
+A Contribution to the Theory of Chromatic Polynomials
+Normal rank
@@ Property / cites work @@
+On dichromatic polynomials
@@ Property / cites work: On dichromatic polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Q4704790
@@ Property / cites work: Q4704790 / rank @@
+Normal rank