Pages that link to "Item:Q3652549"
From MaRDI portal
The following pages link to Packing two copies of a sparse graph into a graph with restrained maximum degree (Q3652549):
Displaying 6 items.
- A note on packing two copies of a tree into a graph with small maximum degree (Q785787) (← links)
- On embedding graphs with bounded sum of size and maximum degree (Q2017040) (← links)
- Packing three copies of a tree into its sixth power (Q2243090) (← links)
- Packing a tree with a graph of the same size (Q3691689) (← links)
- Embedding Arbitrary Graphs of Maximum Degree Two (Q4289355) (← links)
- Placing two edge-disjoint copies of a tree into a bipartite graph (Q6105991) (← links)