On the greatest number of 2 and 3 colorings of a (v, e)-graph (Q3832593): Difference between revisions

← Older edit

@@ Property / DOI @@
-.1002/jgt.3190130207
@@ Property / DOI: 10.1002/jgt.3190130207 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.3190130207
+Normal rank
@@ Property / OpenAlex ID @@
+W2034027701
@@ Property / OpenAlex ID: W2034027701 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Coloured Graphs. III
@@ Property / cites work: Counting Coloured Graphs. III / rank @@
+Normal rank
@@ Property / DOI @@
+.1002/JGT.3190130207
@@ Property / DOI: 10.1002/JGT.3190130207 / rank @@
+Normal rank
@@ Property / Recommended article @@
+Backtrack: An O(1) expected time algorithm for the graph coloring problem
+Normal rank
+Similarity Score: 0.84080833Amount 0.84080833
Unit 1
-Amount
+.84080833
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A theoretical analysis of backtracking in the graph coloring problem
+Normal rank
+Similarity Score: 0.8110575Amount 0.8110575
Unit 1
-Amount
+.8110575
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q3757933
@@ Property / Recommended article: Q3757933 / rank @@
+Normal rank
@@ Property / Recommended article: Q3757933 / qualifier @@
+Similarity Score: 0.79983556Amount 0.79983556
Unit 1
-Amount
+.79983556
 Unit
@@ Property / Recommended article: Q3757933 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+EPCOT: An efficient procedure for coloring optimally with Tabu Search
+Normal rank
+Similarity Score: 0.7973367Amount 0.7973367
Unit 1
-Amount
+.7973367
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Approximation of min coloring by moderately exponential algorithms
+Normal rank
+Similarity Score: 0.7954534Amount 0.7954534
Unit 1
-Amount
+.7954534
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q5705147
@@ Property / Recommended article: Q5705147 / rank @@
+Normal rank
@@ Property / Recommended article: Q5705147 / qualifier @@
+Similarity Score: 0.7946001Amount 0.7946001
Unit 1
-Amount
+.7946001
 Unit
@@ Property / Recommended article: Q5705147 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+The computational complexity of the backbone coloring problem for planar graphs with connected backbones
+Normal rank
+Similarity Score: 0.7928303Amount 0.7928303
Unit 1
-Amount
+.7928303
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+An exact graph coloring algorithm using color exchange
+Normal rank
+Similarity Score: 0.78825116Amount 0.78825116
Unit 1
-Amount
+.78825116
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q4633816
@@ Property / Recommended article: Q4633816 / rank @@
+Normal rank
@@ Property / Recommended article: Q4633816 / qualifier @@
+Similarity Score: 0.78776413Amount 0.78776413
Unit 1
-Amount
+.78776413
 Unit
@@ Property / Recommended article: Q4633816 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A still better performance guarantee for approximate graph coloring
+Normal rank
+Similarity Score: 0.7858351Amount 0.7858351
Unit 1
-Amount
+.7858351
 Unit
+Recommender Run: Recommender Run 2