Connected P3-game on grids and tori
碩士 === 國立清華大學 === 資訊工程學系 === 105 === Let G = (V,E) be a connected graph. We say a set U ⊆ V is P3-convex if every vertex of V\U has at most one neighbor in U. For any set W ⊆ V , we use σ(W) to denote the unique minimal P3-convex set of vertices that contains W. Two players play the connected P3-gam...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/hqf2zn |