A study of t-packing and t-covering
碩士 === 國立交通大學 === 應用數學系 === 91 === A t-packing of a graph G is a collection of t edge-disjoint isomorphic subgraphs of G such that each subgraph is of size [|E(G)|/t]. A t-covering of a graph G is a collection of t edge-disjoint isomorphic graphs H1,H2,...,Ht such that all edge...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/50732350341796590718 |