The following pages link to Graph packings (Q2816101):
Displaying 35 items.
- Toward Żak's conjecture on graph packing (Q286756) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Induced graph packing problems (Q604669) (← links)
- Complexity of the packing coloring problem for trees (Q972338) (← links)
- On the complexity of digraph packings (Q1007581) (← links)
- Packings by cliques and by finite families of graphs (Q1068852) (← links)
- Relaxations of vertex packing (Q1078206) (← links)
- Packing smaller graphs into a graph (Q1123906) (← links)
- Efficient subgraphs packing (Q1321999) (← links)
- Edge-disjoint packings of graphs (Q1326750) (← links)
- Regular packings of regular graphs (Q1349079) (← links)
- Edge-packing planar graphs by cyclic graphs (Q1382263) (← links)
- Generalizations of matched CNF formulas (Q1777405) (← links)
- Generalized edge packings (Q1825138) (← links)
- Packing of graphs - a survey (Q1825885) (← links)
- Near packings of graphs (Q1953525) (← links)
- Compact graphings (Q2003771) (← links)
- On partial descriptions of König graphs for odd paths and all their spanning supergraphs (Q2115309) (← links)
- Graphs with unique maximum packing of closed neighborhoods (Q2151212) (← links)
- A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs (Q2192977) (← links)
- About a new class of matroid-inducing packing families (Q2370439) (← links)
- Packing bipartite graphs with covers of complete bipartite graphs (Q2442206) (← links)
- Oriented star packings (Q2483479) (← links)
- Packing of graphic \(n\)-tuples (Q2888877) (← links)
- How to Pack Directed Acyclic Graphs into Small Blocks (Q3434563) (← links)
- Subgraph packing -- a survey (Q3972010) (← links)
- (Q4206754) (← links)
- (Q4222171) (← links)
- (Q4340018) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- On the packing numbers in graphs (Q4614038) (← links)
- König Graphs with Respect to the 4-Path and Its Spanning Supergraphs (Q4973244) (← links)
- The Nonnegative Node Weight <i>j</i>-Restricted <i>k</i>-Matching Problems (Q5244876) (← links)
- On König graphs with respect to P4 (Q5374003) (← links)
- On the completeness of a generalized matching problem (Q5402563) (← links)
