Pages that link to "Item:Q286955"
From MaRDI portal
The following pages link to Nearly-perfect hypergraph packing is in NC (Q286955):
Displaying 6 items.
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Integer and fractional packings of hypergraphs (Q864903) (← links)
- Packing directed cycles efficiently (Q867851) (← links)
- On a hypergraph matching problem (Q2494110) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs (Q6139785) (← links)
