A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three (Q2180685): Difference between revisions

@@ Property / describes a project that uses @@
+plantri
@@ Property / describes a project that uses: plantri / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.amc.2020.125233
+Normal rank
@@ Property / OpenAlex ID @@
+W3017170238
@@ Property / OpenAlex ID: W3017170238 / rank @@
+Normal rank
@@ Property / cites work @@
+On Hamiltonian Circuits
@@ Property / cites work: On Hamiltonian Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian Cycles and Uniquely Edge Colourable Graphs
+Normal rank
@@ Property / cites work @@
+Vertices of small degree in uniquely Hamiltonian graphs
+Normal rank
@@ Property / cites work @@
+A degree constraint for uniquely Hamiltonian graphs
+Normal rank
@@ Property / cites work @@
+Spanning cycles of nearly cubic graphs
@@ Property / cites work: Spanning cycles of nearly cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
+Normal rank
@@ Property / cites work @@
+Q4871748
@@ Property / cites work: Q4871748 / rank @@
+Normal rank
@@ Property / cites work @@
+Uniquely Hamiltonian Graphs of Minimum Degree 4
@@ Property / cites work: Uniquely Hamiltonian Graphs of Minimum Degree 4 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3548359
@@ Property / cites work: Q3548359 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4254875
@@ Property / cites work: Q4254875 / rank @@
+Normal rank
@@ Property / cites work @@
+Solution of a Large-Scale Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4737179
@@ Property / cites work: Q4737179 / rank @@
+Normal rank
@@ Property / cites work @@
+Cell-probe lower bounds for the partial match problem
+Normal rank