Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number (Q690542): Difference between revisions

@@ Property / cites work @@
+Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem
+Normal rank
@@ Property / cites work @@
+Maximum \(k\)-regular induced subgraphs
@@ Property / cites work: Maximum \(k\)-regular induced subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Spectral upper bounds for the order of a \(k\)-regular induced subgraph
+Normal rank
@@ Property / cites work @@
+Spectral upper bounds on the size of k-regular induced subgraphs
+Normal rank
@@ Property / cites work @@
+Q4327350
@@ Property / cites work: Q4327350 / rank @@
+Normal rank
@@ Property / cites work @@
+A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
+Normal rank
@@ Property / cites work @@
+A Convex Quadratic Characterization of the Lovász Theta Number
+Normal rank
@@ Property / cites work @@
+A graph‐theoretic generalization of the clique concept
+Normal rank