Forbidden subgraphs and the existence of a 2-factor (Q3055922): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.20454
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20454 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4240683345
@@ Property / OpenAlex ID: W4240683345 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393234
@@ Property / cites work: Q4393234 / rank @@
+Normal rank
@@ Property / cites work @@
+Forbidden subgraphs that imply 2-factors
@@ Property / cites work: Forbidden subgraphs that imply 2-factors / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing forbidden pairs for hamiltonian properties
+Normal rank
@@ Property / cites work @@
+Forbidden triples implying Hamiltonicity: for all graphs
+Normal rank
@@ Property / cites work @@
+Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
+Normal rank
@@ Property / cites work @@
+Characterizing forbidden clawless triples implying Hamiltonian graphs
+Normal rank
@@ Property / cites work @@
+A pair of forbidden subgraphs and perfect matchings.
+Normal rank
@@ Property / cites work @@
+Forbidden subgraphs and bounds on the size of a maximum matching
+Normal rank