Heuristic method to determine lucky \(k\)-polynomials for \(k\)-colorable graphs (Q2178745): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.2478/ausi-2019-0014
+Normal rank
@@ Property / OpenAlex ID @@
+W3002022057
@@ Property / OpenAlex ID: W3002022057 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5855820
@@ Property / cites work: Q5855820 / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow degree-jump coloring of graphs
@@ Property / cites work: Rainbow degree-jump coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An introduction to the <i>k</i>-defect polynomials
+Normal rank
@@ Property / cites work @@
+Q4869540
@@ Property / cites work: Q4869540 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q126304296
@@ Property / Wikidata QID: Q126304296 / rank @@
+Normal rank