On the intersection graph of random caps on a sphere (Q1827342): 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/j.ejc.2003.10.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2090816765
@@ Property / OpenAlex ID: W2090816765 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4187840
@@ Property / cites work: Q4187840 / rank @@
+Normal rank
@@ Property / cites work @@
+The square of every two-connected graph is Hamiltonian
+Normal rank
@@ Property / cites work @@
+Q3291025
@@ Property / cites work: Q3291025 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3975009
@@ Property / cites work: Q3975009 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold for the size of random caps to cover a sphere
+Normal rank
@@ Property / cites work @@
+The length of the shortest edge of a graph on a sphere
+Normal rank
@@ Property / cites work @@
+On a condition for the union of spherical caps to be connected
+Normal rank
@@ Property / cites work @@
+Q3680834
@@ Property / cites work: Q3680834 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5845761
@@ Property / cites work: Q5845761 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4160140
@@ Property / cites work: Q4160140 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1827342