Chain Packings and Odd Subtree Packings.pdf

  1. 1、本文档共17页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Chain Packings and Odd Subtree Packings

Chain Packings and Odd Subtree Packings Garth Isaak Department of Mathematics and Computer Science Dartmouth College, Hanover, NH 1992 Abstract A chain packing H in a graph is a subgraph satisfying given degree con- straints at the vertices. Its size is the number of odd degree vertices in the subgraph. An odd subtree packing is a chain packing which is a forest in which all non-isolated vertices have odd degree in the forest. We show that for a given graph and degree constraints, the size of a maximum chain pack- ing and a maximum odd subtree packing are the same but the same does not hold for a version in which the sum of given weights on the odd degree ver- tices is to be maximized. We also note a reduction to weighted capacitated b-matching for finding a maximum size chain packing, maximum size odd subtree packing and maximum weight chain packing. The main result of this note is the proof that a min-max formula generalizing the Berge-Tutte formula for matching holds for chain packing. 1 Introduction Edge disjoint packings of chains as an extension of matching have been studied by deWerra [14, 15, 16], deWerra and Pulleyblank [13] and deWerra and Roberts [17]. In [14, 15, 16, 13] the chains have odd length. Chain Packings of general length are studied in [17]. A chain packing H in a graph G is a subgraph of G satisfying given degree constraints. Its size is the number of vertices with odd degree in H. We will examine chain packings and a closely related notion of odd subtree packings. An odd subtree packing F is a chain packing for which each non-trivial component is a tree containing no even degree vertices. Its size is the number of odd degree vertices in F . Thus, odd subtree packing can be viewed as a generalization of matching in which matched edges are replaced by odd subtrees satisfying certain degree constraints. Related, but distinct problems of packing with the subgraphs drawn from a fixed family and finding subgraphs satisfying degree constraints have

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档