On bipartization of cubic graphs by removal of an independent set (Q298966): Difference between revisions

@@ Property / cites work @@
+Fast algorithms for max independent set
@@ Property / cites work: Fast algorithms for max independent set / rank @@
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+Equitable coloring and the maximum degree
@@ Property / cites work: Equitable coloring and the maximum degree / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Bipartization and via minimization
@@ Property / cites work: Graph Bipartization and via minimization / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum independent sets in 3- and 4-regular Hamiltonian graphs
+Normal rank
@@ Property / cites work @@
+On the independence number of random cubic graphs
@@ Property / cites work: On the independence number of random cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
+Normal rank
@@ Property / cites work @@
+Independent sets in triangle-free cubic planar graphs
+Normal rank
@@ Property / cites work @@
+Algorithm Engineering for Optimal Graph Bipartization
+Normal rank
@@ Property / cites work @@
+Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3
+Normal rank
@@ Property / cites work @@
+On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
+Normal rank