Packing degenerate graphs greedily (Q1689877): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An approximate version of the tree packing conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing spanning graphs from separable families / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing trees of unbounded degrees in random graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal packings of bounded degree trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A blow-up lemma for approximate decompositions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing minor-closed families of graphs into complete graphs / rank | |||
Normal rank |
Latest revision as of 23:15, 14 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Packing degenerate graphs greedily |
scientific article |
Statements
Packing degenerate graphs greedily (English)
0 references
18 January 2018
0 references
tree packing conjecture
0 references
graph packing
0 references
graph processes
0 references