File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Bonds with parity constraints

TitleBonds with parity constraints
Authors
Chen, XDing, GYu, XZang, W
Keywords2-Linkage
Bond
Parity condition
Planar graph
Issue Date2012
PublisherAcademic 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?
DOI: http://dx.doi.org/10.1016/j.jctb.2011.08.005
AbstractGiven 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 Identifierhttp://hdl.handle.net/10722/137324
ISSN
0095-8956
2021 Impact Factor: 1.491
2020 SCImago Journal Rankings: 1.686
ISI Accession Number ID
WOS:000301619300002
Funding AgencyGrant Number
NSF of China10771209
Chinese Academy of Scienceskjcx-yw-s7
NSFDMS-1001230
NSAH98230-10-1-0186
Research Grants Council of Hong Kong
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
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorChen, Xen_HK
dc.contributor.authorDing, Gen_HK
dc.contributor.authorYu, Xen_HK
dc.contributor.authorZang, Wen_HK
dc.date.accessioned2011-08-26T14:23:17Z-
dc.date.available2011-08-26T14:23:17Z-
dc.date.issued2012en_HK
dc.identifier.citationJournal Of Combinatorial Theory. Series B, 2012, v. 102 n. 3, p. 588-609en_HK
dc.identifier.issn0095-8956en_HK
dc.identifier.urihttp://hdl.handle.net/10722/137324-
dc.description.abstractGiven 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.languageengen_US
dc.publisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jctben_HK
dc.relation.ispartofJournal of Combinatorial Theory. Series Ben_HK
dc.subject2-Linkageen_HK
dc.subjectBonden_HK
dc.subjectParity conditionen_HK
dc.subjectPlanar graphen_HK
dc.titleBonds with parity constraintsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0095-8956&volume=to appear&spage=&epage=&date=2011&atitle=Bonds+with+Parity+Constriantsen_US
dc.identifier.emailZang, W:wzang@maths.hku.hken_HK
dc.identifier.authorityZang, W=rp00839en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.jctb.2011.08.005en_HK
dc.identifier.scopuseid_2-s2.0-84857624008en_HK
dc.identifier.hkuros205928en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-84857624008&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume102en_HK
dc.identifier.issue3en_HK
dc.identifier.spage588en_HK
dc.identifier.epage609en_HK
dc.identifier.isiWOS:000301619300002-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridChen, X=8987182300en_HK
dc.identifier.scopusauthoridDing, G=7201791806en_HK
dc.identifier.scopusauthoridYu, X=7404115058en_HK
dc.identifier.scopusauthoridZang, W=7005740804en_HK
dc.identifier.citeulike9835577-
dc.identifier.issnl0095-8956-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats