发表评论

On Gallai's conjecture for series-parallel graphs and planar 3-trees. (arXiv:1706.04130v1 [math.CO])

来源于:arXiv
A path cover is a decomposition of the edges of a graph into edge-disjoint simple paths. Gallai conjectured that every connected $n$-vertex graph has a path cover with at most $\lceil n/2 \rceil$ path

发表评论

用户名:   登录|注册账号
标题:
评论:
使用预览按钮!检查错误!引用添加:[quote][/quote] 链接添加:[url][/url]