The following pages link to On generalized matching problems (Q1149783):
Displaying 15 items.
- The complexity of generalized domino tilings (Q396923) (← links)
- Chain packing in graphs (Q808291) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- On the complexity of digraph packings (Q1007581) (← links)
- Packings by cliques and by finite families of graphs (Q1068852) (← links)
- A parameter linked with \(G\)-factors and the binding number (Q1182867) (← links)
- On the tree packing problem (Q1183337) (← links)
- Generalized partitions of graphs (Q1283792) (← links)
- Maximum tree-packing in time \(O(n^{5/2})\) (Q1391314) (← links)
- Maximum packing for biconnected outerplanar graphs (Q1962022) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- On caterpillar factors in graphs (Q2210502) (← links)
- Oriented star packings (Q2483479) (← links)
- Packings by Complete Bipartite Graphs (Q3728943) (← links)
- Maximum tree-packing in time O(n5/2) (Q6085700) (← links)
