Pages that link to "Item:Q1378488"
From MaRDI portal
The following pages link to Packing graphs: The packing problem solved (Q1378488):
Displaying 20 items.
- An approximate version of the tree packing conjecture (Q273108) (← links)
- Uniform hypergraphs containing no grids (Q390731) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Completing partial packings of bipartite graphs (Q640856) (← links)
- Generalising Fisher's inequality to coverings and packings (Q681600) (← links)
- Planar packing of trees and spider trees (Q976102) (← links)
- Covering graphs: The covering problem solved (Q1269896) (← links)
- Packing of graphs and permutations -- a survey (Q1422441) (← links)
- Packing and decomposition of graphs with trees (Q1569062) (← links)
- The packing number of the double vertex graph of the path graph (Q1671357) (← links)
- Orthogonal decomposition and packing of complete graphs (Q1806215) (← links)
- \(H\)-packing of \(k\)-chromatic graphs (Q1937363) (← links)
- Intersecting designs (Q1971015) (← links)
- Clumsy packings of graphs (Q2001970) (← links)
- On zero-sum spanning trees and zero-sum connectivity (Q2073300) (← links)
- Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions (Q2565683) (← links)
- (Q4691855) (← links)
- Leaves for packings with block size four (Q5000309) (← links)
- Block allocation of a sequential resource (Q5217060) (← links)
- Packing cliques in 3‐uniform hypergraphs (Q6187456) (← links)