A sufficient condition for a graph to be an (a, b, k)-critical graph (Q3056357): Difference between revisions

@@ Property / author @@
-Si-zhong Zhou
@@ Property / author: Si-zhong Zhou / rank @@
-Normal rank
@@ Property / author @@
+Si-zhong Zhou
@@ Property / author: Si-zhong Zhou / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207160902777914
+Normal rank
@@ Property / OpenAlex ID @@
+W2086829022
@@ Property / OpenAlex ID: W2086829022 / rank @@
+Normal rank
@@ Property / cites work @@
+On factors with given components
@@ Property / cites work: On factors with given components / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and the existence of \(k\)-factors. IV
@@ Property / cites work: Toughness and the existence of \(k\)-factors. IV / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for a graph to have \([a,b]\)-factors
+Normal rank
@@ Property / cites work @@
+A new degree condition for graphs to have \([a,b]\)-factor
+Normal rank
@@ Property / cites work @@
+BINDING NUMBER CONDITIONS FOR (a, b, k)-CRITICAL GRAPHS
+Normal rank
@@ Property / cites work @@
+Some sufficient conditions for graphs to have (<i>g, f</i>)-factors
+Normal rank

A sufficient condition for a graph to be an (<i>a, b, k</i>)-critical graph (Q3056357): Difference between revisions