A note on chromatic number and connectivity of infinite graphs (Q375903): Difference between revisions

@@ Property / DOI @@
-.1007/s11856-012-0176-z
@@ Property / DOI: 10.1007/s11856-012-0176-z / 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.1007/s11856-012-0176-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2013589923
@@ Property / OpenAlex ID: W2013589923 / rank @@
+Normal rank
@@ Property / cites work @@
+On chromatic number of graphs and set-systems
@@ Property / cites work: On chromatic number of graphs and set-systems / rank @@
+Normal rank
@@ Property / cites work @@
+Partition Relations Connected with the Chromatic Number of Graphs
+Normal rank
@@ Property / cites work @@
+A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number
+Normal rank
@@ Property / cites work @@
+A Negative Partition Relation
@@ Property / cites work: A Negative Partition Relation / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity and chromatic number of infinite graphs
+Normal rank
@@ Property / cites work @@
+Consistency results on infinite graphs
@@ Property / cites work: Consistency results on infinite graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S11856-012-0176-Z
@@ Property / DOI: 10.1007/S11856-012-0176-Z / rank @@
+Normal rank