Planar cubic hypohamiltonian and hypotraceable graphs (Q1250114): Difference between revisions

@@ 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/0095-8956(81)90089-7
+Normal rank
@@ Property / OpenAlex ID @@
+W1983648682
@@ Property / OpenAlex ID: W1983648682 / rank @@
+Normal rank
@@ Property / cites work @@
+Cubic identity graphs and planar graphs derived from trees
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Flip-Flops in Hypohamiltonian Graphs
@@ Property / cites work: Flip-Flops in Hypohamiltonian Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+New flip-flop constructions for hypohamiltonian graphs
+Normal rank
@@ Property / cites work @@
+Systematic searches for hypohamiltonian graphs
@@ Property / cites work: Systematic searches for hypohamiltonian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+New families of hypohamiltonian graphs
@@ Property / cites work: New families of hypohamiltonian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Non-Hamiltonian cubic planar maps
@@ Property / cites work: Non-Hamiltonian cubic planar maps / rank @@
+Normal rank
@@ Property / cites work @@
+Q5547252
@@ Property / cites work: Q5547252 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertices missed by longest paths or circuits
@@ Property / cites work: Vertices missed by longest paths or circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Q5593801
@@ Property / cites work: Q5593801 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar and infinite hypohamiltonian and hypotraceable graphs
+Normal rank
@@ Property / cites work @@
+On Hamiltonian Circuits
@@ Property / cites work: On Hamiltonian Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+On longest paths and circuits in graphs.
@@ Property / cites work: On longest paths and circuits in graphs. / rank @@
+Normal rank