The following pages link to Subgraph packing -- a survey (Q3972010):
Displaying 15 items.
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Good characterizations for some degree constrained subgraphs (Q1003846) (← links)
- Packings by cliques and by finite families of graphs (Q1068852) (← links)
- Efficient subgraphs packing (Q1321999) (← links)
- Edge-disjoint packings of graphs (Q1326750) (← links)
- Optimal packing of induced stars in a graph (Q1367032) (← links)
- Packing of graphs - a survey (Q1825885) (← links)
- Packing paths of length at least two (Q1827782) (← links)
- Maximum 0-1 timed matching on temporal graphs (Q2161255) (← links)
- About a new class of matroid-inducing packing families (Q2370439) (← links)
- Parameterized and approximation algorithms for the load coloring problem (Q2408202) (← links)
- Packing \([1, \Delta ]\)-factors in graphs of small degree (Q2460103) (← links)
- Graph packings (Q2816101) (← links)
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering (Q4568066) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
