Constructing the nearly shortest path in crossed cubes (Q2390375): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ins.2009.02.018
+Normal rank
@@ Property / OpenAlex ID @@
+W1996374919
@@ Property / OpenAlex ID: W1996374919 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4365373
@@ Property / cites work: Q4365373 / rank @@
+Normal rank
@@ Property / cites work @@
+-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
+Normal rank
@@ Property / cites work @@
+Finding the k Shortest Paths
@@ Property / cites work: Finding the k Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Node-pancyclicity and edge-pancyclicity of crossed cubes
+Normal rank
@@ Property / cites work @@
+Complete path embeddings in crossed cubes
@@ Property / cites work: Complete path embeddings in crossed cubes / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-pancyclicity and path-embeddability of bijective connection graphs
+Normal rank
@@ Property / cites work @@
+Connected, locally 2-connected,K1,3-free graphs are panconnected
+Normal rank
@@ Property / cites work @@
+Embedding binary trees into crossed cubes
@@ Property / cites work: Embedding binary trees into crossed cubes / rank @@
+Normal rank
@@ Property / cites work @@
+Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
+Normal rank
@@ Property / cites work @@
+Q4002466
@@ Property / cites work: Q4002466 / rank @@
+Normal rank
@@ Property / cites work @@
+Letter to the Editor—The <i>k</i>th Best Route Through a Network
+Normal rank
@@ Property / cites work @@
+Panconnectivity of locally connected claw-free graphs
+Normal rank
@@ Property / cites work @@
+Paths in Möbius cubes and crossed cubes
@@ Property / cites work: Paths in Möbius cubes and crossed cubes / rank @@
+Normal rank
@@ Property / cites work @@
+On the double-vertex-cycle-connectivity of crossed cubes
+Normal rank