Toughness and \([a, b]\)-factors with inclusion\(/\)exclusion properties (Q763635): Difference between revisions

@@ Property / cites work @@
+Q4032983
@@ Property / cites work: Q4032983 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4024344
@@ Property / cites work: Q4024344 / rank @@
+Normal rank
@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and the existence ofk-factors
@@ Property / cites work: Toughness and the existence ofk-factors / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness of graphs and the existence of factors
@@ Property / cites work: Toughness of graphs and the existence of factors / rank @@
+Normal rank
@@ Property / cites work @@
+Q3114954
@@ Property / cites work: Q3114954 / rank @@
+Normal rank
@@ Property / cites work @@
+Orthogonal (g, f)-factorizations in networks
@@ Property / cites work: Orthogonal (g, f)-factorizations in networks / rank @@
+Normal rank
@@ Property / cites work @@
+Subgraphs with prescribed valencies
@@ Property / cites work: Subgraphs with prescribed valencies / rank @@
+Normal rank
@@ Property / cites work @@
+A remark on the factor theorems of lovász and tutte
+Normal rank
@@ Property / cites work @@
+Q2848802
@@ Property / cites work: Q2848802 / rank @@
+Normal rank