The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (Q2685343): Difference between revisions

@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / cites work @@
+On graphs with polynomially solvable maximum-weight clique problem
+Normal rank
@@ Property / cites work @@
+Q2822598
@@ Property / cites work: Q2822598 / rank @@
+Normal rank
@@ Property / cites work @@
+Properly 2-Colouring Linear Hypergraphs
@@ Property / cites work: Properly 2-Colouring Linear Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring vertices of triangle-free graphs without forests
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
+Normal rank
@@ Property / cites work @@
+A constructive proof of Vizing's theorem
@@ Property / cites work: A constructive proof of Vizing's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank