An \(s\)-Hamiltonian line graph problem (Q995763): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00373-007-0727-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2036580076
@@ Property / OpenAlex ID: W2036580076 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
+Normal rank
@@ Property / cites work @@
+A reduction method to find spanning Eulerian subgraphs
+Normal rank
@@ Property / cites work @@
+Supereulerian graphs: A survey
@@ Property / cites work: Supereulerian graphs: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs without spanning closed trails
@@ Property / cites work: Graphs without spanning closed trails / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning closed trails in graphs
@@ Property / cites work: Spanning closed trails in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2715961
@@ Property / cites work: Q2715961 / rank @@
+Normal rank
@@ Property / cites work @@
+On Eulerian and Hamiltonian Graphs and Line Graphs
+Normal rank
@@ Property / cites work @@
+On n-hamiltonian line graphs
@@ Property / cites work: On n-hamiltonian line graphs / rank @@
+Normal rank