On Complexity of Total Vertex Cover on Subcubic Graphs
碩士 === 國立清華大學 === 資訊系統與應用研究所 === 104 === A total vertex cover is a vertex cover whose induced subgraph consists of a set of connected components, each of which contains at least two vertices. A t-total vertex cover is a total vertex cover where each component of its induced subgraph contains at leas...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/21471822635515100142 |