STABILITY NUMBER AND MINIMUM DEGREE FOR (a, b, k)-CRITICAL GRAPHS (Q2874038): Difference between revisions

@@ Property / cites work @@
+The existence of \(k\)-factors in squares of graphs
+Normal rank
@@ Property / cites work @@
+Star subdivisions and connected even factors in the square of a graph
+Normal rank
@@ Property / cites work @@
+Binding numbers and connected factors
@@ Property / cites work: Binding numbers and connected factors / rank @@
+Normal rank
@@ Property / cites work @@
+The stability number and connected \([k,k+1]\)-factor in graphs
+Normal rank
@@ Property / cites work @@
+A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs
+Normal rank
@@ Property / cites work @@
+Binding numbers and \([a,b]\)-factors excluding a given \(k\)-factor
+Normal rank
@@ Property / cites work @@
+Independence number, connectivity and \((a,b,k)\)-critical graphs
+Normal rank
@@ Property / cites work @@
+A sufficient condition for a graph to be an (<i>a, b, k</i>)-critical graph
+Normal rank
@@ Property / cites work @@
+A binding number condition for graphs to be \((a, b, k)\)-critical graphs
+Normal rank
@@ Property / cites work @@
+Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
+Normal rank
@@ Property / cites work @@
+A new degree condition for graphs to have \([a,b]\)-factor
+Normal rank