BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS (Q3115766): Difference between revisions

@@ Property / cites work @@
+Independence number, connectivity and \((a,b,k)\)-critical graphs
+Normal rank
@@ Property / cites work @@
+Fan-type results for the existence of [\(a\),\(b\)]-factors
+Normal rank
@@ Property / cites work @@
+Toughness and the existence of fractional \(k\)-factors of graphs
+Normal rank
@@ Property / cites work @@
+A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (<i>k</i>, <i>m</i>)-DELETED GRAPHS
+Normal rank
@@ Property / cites work @@
+The stability number and connected \([k,k+1]\)-factor in graphs
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and \((a,b,k)\)-critical graphs
@@ Property / cites work: Toughness and \((a,b,k)\)-critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs
+Normal rank
@@ Property / cites work @@
+Some new sufficient conditions for graphs to have fractional<i>k</i>-factors
+Normal rank
@@ Property / cites work @@
+The existence of \(k\)-factors in squares of graphs
+Normal rank

BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (<i>k</i>,<i>m</i>)-DELETED GRAPHS (Q3115766): Difference between revisions