Packing trees into \(n\)-chromatic graphs (Q2442277): Difference between revisions

@@ Property / author @@
-András Gyárfás
@@ Property / author: András Gyárfás / rank @@
-Normal rank
@@ Property / author @@
+András Gyárfás
@@ Property / author: András Gyárfás / 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.7151/dmgt.1735
@@ Property / full work available at URL: https://doi.org/10.7151/dmgt.1735 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2049995225
@@ Property / OpenAlex ID: W2049995225 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalizations of the tree packing conjecture
@@ Property / cites work: Generalizations of the tree packing conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Q4170743
@@ Property / cites work: Q4170743 / rank @@
+Normal rank
@@ Property / cites work @@
+Induced subtrees in graphs of large chromatic number
+Normal rank
@@ Property / cites work @@
+Q4186364
@@ Property / cites work: Q4186364 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2442277