Pages that link to "Item:Q4667859"
From MaRDI portal
The following pages link to Integer and fractional packing of families of graphs (Q4667859):
Displaying 18 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)
- Regarding two conjectures on clique and biclique partitions (Q2121747) (← links)
- Clique decompositions of multipartite graphs and completion of Latin squares (Q2363362) (← links)
- Minimum \(H\)-decompositions of graphs (Q2384810) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions (Q2565683) (← links)
- Packing Triangles in Regular Tournaments (Q2852611) (← links)
- Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing (Q3168450) (← links)
- Constructive Packings of Triple Systems (Q4591229) (← links)
- Sharp bounds for decomposing graphs into edges and triangles (Q4993262) (← links)
- Decomposing Graphs into Edges and Triangles (Q5222546) (← links)
- Constructive Packings by Linear Hypergraphs (Q5397735) (← links)
- Packing Cliques in Graphs with Independence Number 2 (Q5443808) (← links)
- Edge-decompositions of graphs with high minimum degree (Q5899605) (← links)
- On the Weisfeiler-Leman dimension of fractional packing (Q5918531) (← links)
- Packing and Covering a Given Directed Graph in a Directed Graph (Q6146269) (← links)
