File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.jctb.2011.08.005
- Scopus: eid_2-s2.0-84857624008
- WOS: WOS:000301619300002
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Bonds with parity constraints
Title | Bonds with parity constraints | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Authors | |||||||||||||
Keywords | 2-Linkage Bond Parity condition Planar graph | ||||||||||||
Issue Date | 2012 | ||||||||||||
Publisher | Academic Press. The Journal's web site is located at http://www.elsevier.com/locate/jctb | ||||||||||||
Citation | Journal Of Combinatorial Theory. Series B, 2012, v. 102 n. 3, p. 588-609 How to Cite? | ||||||||||||
Abstract | Given a connected graph G=(V, E) and three even-sized subsets A 1, A 2, A 3 of V, when does V have a partition (S 1, S 2) such that G[S i] is connected and |S i∩A j| is odd for all i=1, 2 and j=1, 2, 3? This problem arises in the area of integer flow theory and has theoretical interest in its own right. The special case when |A 1|=|A 2|=|A 3|=2 has been resolved by Chakravarti and Robertson, and the general problem can be rephrased as a problem on binary matroids that asks if a given triple of elements is contained in a circuit. The purpose of this paper is to present a complete solution to this problem based on a strengthening of Seymour's theorem on triples in matroid circuits. © 2011 Elsevier Inc. | ||||||||||||
Persistent Identifier | http://hdl.handle.net/10722/137324 | ||||||||||||
ISSN | 2015 Impact Factor: 1.094 2015 SCImago Journal Rankings: 2.411 | ||||||||||||
ISI Accession Number ID |
Funding Information: Supported in part by NSF of China under Grant No. 10771209, and Chinese Academy of Sciences under Grant No. kjcx-yw-s7. | ||||||||||||
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, X | en_HK |
dc.contributor.author | Ding, G | en_HK |
dc.contributor.author | Yu, X | en_HK |
dc.contributor.author | Zang, W | en_HK |
dc.date.accessioned | 2011-08-26T14:23:17Z | - |
dc.date.available | 2011-08-26T14:23:17Z | - |
dc.date.issued | 2012 | en_HK |
dc.identifier.citation | Journal Of Combinatorial Theory. Series B, 2012, v. 102 n. 3, p. 588-609 | en_HK |
dc.identifier.issn | 0095-8956 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/137324 | - |
dc.description.abstract | Given a connected graph G=(V, E) and three even-sized subsets A 1, A 2, A 3 of V, when does V have a partition (S 1, S 2) such that G[S i] is connected and |S i∩A j| is odd for all i=1, 2 and j=1, 2, 3? This problem arises in the area of integer flow theory and has theoretical interest in its own right. The special case when |A 1|=|A 2|=|A 3|=2 has been resolved by Chakravarti and Robertson, and the general problem can be rephrased as a problem on binary matroids that asks if a given triple of elements is contained in a circuit. The purpose of this paper is to present a complete solution to this problem based on a strengthening of Seymour's theorem on triples in matroid circuits. © 2011 Elsevier Inc. | en_HK |
dc.language | eng | en_US |
dc.publisher | Academic Press. The Journal's web site is located at http://www.elsevier.com/locate/jctb | en_HK |
dc.relation.ispartof | Journal of Combinatorial Theory. Series B | en_HK |
dc.subject | 2-Linkage | en_HK |
dc.subject | Bond | en_HK |
dc.subject | Parity condition | en_HK |
dc.subject | Planar graph | en_HK |
dc.title | Bonds with parity constraints | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0095-8956&volume=to appear&spage=&epage=&date=2011&atitle=Bonds+with+Parity+Constriants | en_US |
dc.identifier.email | Zang, W:wzang@maths.hku.hk | en_HK |
dc.identifier.authority | Zang, W=rp00839 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/j.jctb.2011.08.005 | en_HK |
dc.identifier.scopus | eid_2-s2.0-84857624008 | en_HK |
dc.identifier.hkuros | 205928 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-84857624008&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 102 | en_HK |
dc.identifier.issue | 3 | en_HK |
dc.identifier.spage | 588 | en_HK |
dc.identifier.epage | 609 | en_HK |
dc.identifier.isi | WOS:000301619300002 | - |
dc.publisher.place | United States | en_HK |
dc.identifier.scopusauthorid | Chen, X=8987182300 | en_HK |
dc.identifier.scopusauthorid | Ding, G=7201791806 | en_HK |
dc.identifier.scopusauthorid | Yu, X=7404115058 | en_HK |
dc.identifier.scopusauthorid | Zang, W=7005740804 | en_HK |
dc.identifier.citeulike | 9835577 | - |