Spanning spiders and light-splitting switches (Q1877652): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2004.04.005
@@ Property / DOI: 10.1016/j.disc.2004.04.005 / rank @@
-Normal rank
@@ Property / author @@
-Mikael Hammar
@@ Property / author: Mikael Hammar / rank @@
-Normal rank
@@ Property / author @@
-Q790131
@@ Property / author: Q790131 / rank @@
-Normal rank
@@ Property / author @@
+Mikael Hammar
@@ Property / author: Mikael Hammar / rank @@
+Normal rank
@@ Property / author @@
+Pavol Hell
@@ Property / author: Pavol Hell / 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.disc.2004.04.005
+Normal rank
@@ Property / OpenAlex ID @@
+W1999323173
@@ Property / OpenAlex ID: W1999323173 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal trees with bounded maximum degree in a graph
+Normal rank
@@ Property / cites work @@
+On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
+Normal rank
@@ Property / cites work @@
+Hamiltonicity for <i>K</i><sub>1, r</sub>‐free graphs
+Normal rank
@@ Property / cites work @@
+A note on Hamiltonian circuits
@@ Property / cites work: A note on Hamiltonian circuits / 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 @@
+Finding long paths and cycles in sparse Hamiltonian graphs
+Normal rank
@@ Property / cites work @@
+Q4449221
@@ Property / cites work: Q4449221 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737170
@@ Property / cites work: Q4737170 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4946041
@@ Property / cites work: Q4946041 / rank @@
+Normal rank
@@ Property / cites work @@
+On approximating the longest path in a graph
@@ Property / cites work: On approximating the longest path in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for a graph to have a \(k\)-tree
+Normal rank
@@ Property / cites work @@
+Q5625199
@@ Property / cites work: Q5625199 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4304374
@@ Property / cites work: Q4304374 / rank @@
+Normal rank
@@ Property / cites work @@
+Longest paths and cycles in K1,3-free graphs
@@ Property / cites work: Longest paths and cycles in K1,3-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Hypohamiltonian and hypotraceable graphs
@@ Property / cites work: Hypohamiltonian and hypotraceable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Planar cubic hypohamiltonian and hypotraceable graphs
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2004.04.005
@@ Property / DOI: 10.1016/J.DISC.2004.04.005 / rank @@
+Normal rank