Edge coloring of graphs, uses, limitation, complexity (Q2629566): Difference between revisions

@@ Property / author @@
-Sándor Szabó
@@ Property / author: Sándor Szabó / rank @@
-Normal rank
@@ Property / author @@
-Bogdán Zaválnij
@@ Property / author: Bogdán Zaválnij / rank @@
-Normal rank
@@ Property / author @@
+Sándor Szabó
@@ Property / author: Sándor Szabó / rank @@
+Normal rank
@@ Property / author @@
+Bogdán Zaválnij
@@ Property / author: Bogdán Zaválnij / 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.1515/ausi-2016-0004
+Normal rank
@@ Property / OpenAlex ID @@
+W2474458879
@@ Property / OpenAlex ID: W2474458879 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3145799
@@ Property / cites work: Q3145799 / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum clique problem
@@ Property / cites work: An exact algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+Test case generators and computational results for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Q5705147
@@ Property / cites work: Q5705147 / rank @@
+Normal rank
@@ Property / cites work @@
+Sur le coloriage des graphs
@@ Property / cites work: Sur le coloriage des graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank