Universal graphs with a forbidden subgraph: block path solidity (Q1677537): Difference between revisions

@@ Property / DOI @@
-.1007/s00493-014-3181-5
@@ Property / DOI: 10.1007/s00493-014-3181-5 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W1513497564
@@ Property / OpenAlex ID: W1513497564 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.5757
@@ Property / arXiv ID: 1404.5757 / rank @@
+Normal rank
@@ Property / cites work @@
+Universal graphs with a forbidden subtree
@@ Property / cites work: Universal graphs with a forbidden subtree / rank @@
+Normal rank
@@ Property / cites work @@
+Universal graphs with a forbidden near‐path or 2‐bouquet
+Normal rank
@@ Property / cites work @@
+Club guessing and the universal models
@@ Property / cites work: Club guessing and the universal models / rank @@
+Normal rank
@@ Property / cites work @@
+On the existence of countable universal graphs
@@ Property / cites work: On the existence of countable universal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A family of countable homogeneous graphs
@@ Property / cites work: A family of countable homogeneous graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Universal elements and the complexity of certain classes of infinite graphs
+Normal rank
@@ Property / DOI @@
+.1007/S00493-014-3181-5
@@ Property / DOI: 10.1007/S00493-014-3181-5 / rank @@
+Normal rank