Minimum degree ensuring that a hypergraph is Hamiltonian-connected (Q6080369): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejc.2023.103782
@@ Property / DOI: 10.1016/j.ejc.2023.103782 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W4385896089
@@ Property / OpenAlex ID: W4385896089 / rank @@
+Normal rank
@@ Property / cites work @@
+Some Theorems on Abstract Graphs
@@ Property / cites work: Some Theorems on Abstract Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hamilton connected graphs
@@ Property / cites work: Hamilton connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5722819
@@ Property / cites work: Q5722819 / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for hamiltonian connectedness
+Normal rank
@@ Property / cites work @@
+Q4200095
@@ Property / cites work: Q4200095 / rank @@
+Normal rank
@@ Property / cites work @@
+A Dirac-type theorem for Berge cycles in random hypergraphs
+Normal rank
@@ Property / cites work @@
+A Rainbow Dirac's Theorem
@@ Property / cites work: A Rainbow Dirac's Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+n-Hamiltonian graphs
@@ Property / cites work: n-Hamiltonian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.EJC.2023.103782
@@ Property / DOI: 10.1016/J.EJC.2023.103782 / rank @@
+Normal rank