Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor (Q6099108): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1155/2023/9932025
+Normal rank
@@ Property / OpenAlex ID @@
+W4367059750
@@ Property / OpenAlex ID: W4367059750 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3910557
@@ Property / cites work: Q3910557 / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
+Normal rank
@@ Property / cites work @@
+The extension degree conditions for fractional factor
+Normal rank
@@ Property / cites work @@
+Isolated toughness for path factors in networks
@@ Property / cites work: Isolated toughness for path factors in networks / rank @@
+Normal rank
@@ Property / cites work @@
+On path-factor critical deleted (or covered) graphs
+Normal rank
@@ Property / cites work @@
+TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
+Normal rank
@@ Property / cites work @@
+Isolated toughness and path-factor uniform graphs
@@ Property / cites work: Isolated toughness and path-factor uniform graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Path factors and neighborhoods of independent sets in graphs
+Normal rank
@@ Property / cites work @@
+On \(P_{\geq 3}\)-factor deleted graphs
@@ Property / cites work: On \(P_{\geq 3}\)-factor deleted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
+Normal rank
@@ Property / cites work @@
+Packing paths of length at least two
@@ Property / cites work: Packing paths of length at least two / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
+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 @@
+Q2765142
@@ Property / cites work: Q2765142 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2744319
@@ Property / cites work: Q2744319 / rank @@
+Normal rank
@@ Property / cites work @@
+The binding number of a graph and its Anderson number
+Normal rank
@@ Property / cites work @@
+The existence of \(P_{\geq3}\)-factor covered graphs
+Normal rank