On Gallai''s conjecture for path decomposition of graphs
碩士 === 國立臺灣大學 === 數學研究所 === 91 === Suppose $G=(V,E)$ is a simple, finite, undirected graph. A path decomposition $\Sigma$ for a graph $G$ is a partition of the edge set $E$ into paths. Denote $p(G)$ the minimum number of paths needed for a path decomposition of a graph $G$. Gallai conject...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/18926402779578053558 |