The maximal P_(k+1)-packings of K_n
碩士 === 國立交通大學 === 應用數學系所 === 99 === An H-packing P = fH1;H2; : : : ;Hsg of a graph G is a set of edge-disjoint subgraphs of G in which each subgraph Hi is isomorphic to H. The leave L of P is the subgraph induced by the set of edges of G that does not occur in any Hi. P is a maximal H-packing if...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/42820351610538337219 |