您当前所在位置: 首页 > 学者

张昭

  • 18浏览

  • 0点赞

  • 0收藏

  • 0分享

  • 0下载

  • 0评论

  • 引用

期刊论文

Eulerian Subgraphs Containing Given Vertices

暂无

SIAM J. Discrete Math.,-0001,25(2):611–621 | doi.org/10.1137/060663337

URL:https://epubs.siam.org/action/showAbstract?page=611&volume=25&issue=2&journalCode=sjdmec

摘要/描述

A vertex set S⊆V(G) is k-weak-edge-connected if, for every C⊂Sand x∈S−C, there are min{k,|C|} edge-disjoint (x, C)-paths in G. For a graph G and a k-weak-edge-connected vertex set S⊂V(G) with k≥3 and 4≤|S|≤2k, we show that G has an Eulerian subgraph containing all vertices in S.

关键词:

学者未上传该成果的PDF文件,请等待学者更新

我要评论

全部评论 0

本学者其他成果

    同领域成果