Maximal K3's and Hamiltonicity of 4-connected claw-free graphs (Q2888878): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.20599
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20599 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2164820426
@@ Property / OpenAlex ID: W2164820426 / rank @@
+Normal rank
@@ Property / cites work @@
+A reduction method to find spanning Eulerian subgraphs
+Normal rank
@@ Property / cites work @@
+On Eulerian and Hamiltonian Graphs and Line Graphs
+Normal rank
@@ Property / cites work @@
+Hourglasses and Hamilton cycles in 4‐connected claw‐free graphs
+Normal rank
@@ Property / cites work @@
+Hamiltonian results inK1,3-free graphs
@@ Property / cites work: Hamiltonian results inK1,3-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonicity and forbidden subgraphs in 4‐connected graphs
+Normal rank
@@ Property / cites work @@
+On a closure concept in claw-free graphs
@@ Property / cites work: On a closure concept in claw-free graphs / rank @@
+Normal rank