A short proof of the versatile version of Fleischner's theorem (Q383756): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2012.07.032
+Normal rank
@@ Property / OpenAlex ID @@
+W2052546202
@@ Property / OpenAlex ID: W2052546202 / rank @@
+Normal rank
@@ Property / cites work @@
+Induced \(S(K_{1,3})\) and hamiltonian cycles in the square of a graph
+Normal rank
@@ Property / cites work @@
+On graphs whose square have strong Hamiltonian properties
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian cycles in the square of a graph
@@ Property / cites work: Hamiltonian cycles in the square of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+The square of every two-connected graph is Hamiltonian
+Normal rank
@@ Property / cites work @@
+In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
+Normal rank
@@ Property / cites work @@
+A short proof of Fleischner's theorem
@@ Property / cites work: A short proof of Fleischner's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+A new proof of the theorem by Fleischner
@@ Property / cites work: A new proof of the theorem by Fleischner / rank @@
+Normal rank