The 3-connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial (Q2897206): Difference between revisions

@@ Property / author @@
-Fengming Dong
@@ Property / author: Fengming Dong / rank @@
-Normal rank
@@ Property / author @@
+Fengming Dong
@@ Property / author: Fengming Dong / rank @@
+Normal rank
@@ 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.1002/jgt.20614
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20614 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1568279347
@@ Property / OpenAlex ID: W1568279347 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5313291
@@ Property / cites work: Q5313291 / rank @@
+Normal rank
@@ Property / cites work @@
+Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs
+Normal rank
@@ Property / cites work @@
+An introduction to chromatic polynomials
@@ Property / cites work: An introduction to chromatic polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Cutpoints and the chromatic polynomial
@@ Property / cites work: Cutpoints and the chromatic polynomial / rank @@
+Normal rank