Packing trees into \(n\)-chromatic graphs (Q2442277): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Generalizations of the tree packing conjecture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4170743 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Induced subtrees in graphs of large chromatic number / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4186364 / rank | |||
Normal rank | |||
Latest revision as of 12:57, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packing trees into \(n\)-chromatic graphs |
scientific article |
Statements
Packing trees into \(n\)-chromatic graphs (English)
0 references
2 April 2014
0 references
tree packing
0 references
