File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1006/jctb.2002.2134
- Scopus: eid_2-s2.0-0036847554
- WOS: WOS:000178979600011
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Packing cycles in graphs
Title | Packing cycles in graphs |
---|---|
Authors | |
Issue Date | 2002 |
Publisher | Academic Press. The Journal's web site is located at http://www.elsevier.com/locate/jctb |
Citation | Journal Of Combinatorial Theory. Series B, 2002, v. 86 n. 2, p. 381-407 How to Cite? |
Abstract | A graph G is called cycle Mengerian (CM) if for all nonnegative integral function w defined on V(G), the maximum number of cycles (repetition is allowed) in G such that each vertex v is used at most w(v) times is equal to the minimum of ∑ {w(x) : x ∈ X}, where the minimum is taken over all X ⊆ V(G) such that deleting X from G results in a forest. The purpose of this paper is to characterize all CM graphs in terms of forbidden structures. As a corollary, we prove that if the fractional version of the above minimization problem always have an integral optimal solution, then the fractional version of the maximization problem will always have an integral optimal solution as well. 2002 Elsevier Science (USA). |
Persistent Identifier | http://hdl.handle.net/10722/75346 |
ISSN | 2023 Impact Factor: 1.2 2023 SCImago Journal Rankings: 1.793 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ding, G | en_HK |
dc.contributor.author | Zang, W | en_HK |
dc.date.accessioned | 2010-09-06T07:10:15Z | - |
dc.date.available | 2010-09-06T07:10:15Z | - |
dc.date.issued | 2002 | en_HK |
dc.identifier.citation | Journal Of Combinatorial Theory. Series B, 2002, v. 86 n. 2, p. 381-407 | en_HK |
dc.identifier.issn | 0095-8956 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/75346 | - |
dc.description.abstract | A graph G is called cycle Mengerian (CM) if for all nonnegative integral function w defined on V(G), the maximum number of cycles (repetition is allowed) in G such that each vertex v is used at most w(v) times is equal to the minimum of ∑ {w(x) : x ∈ X}, where the minimum is taken over all X ⊆ V(G) such that deleting X from G results in a forest. The purpose of this paper is to characterize all CM graphs in terms of forbidden structures. As a corollary, we prove that if the fractional version of the above minimization problem always have an integral optimal solution, then the fractional version of the maximization problem will always have an integral optimal solution as well. 2002 Elsevier Science (USA). | en_HK |
dc.language | eng | en_HK |
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.title | Packing cycles in graphs | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0095-8956&volume=86&spage=381&epage=407&date=2002&atitle=Packing+Cycles+in+Graphs | en_HK |
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.1006/jctb.2002.2134 | en_HK |
dc.identifier.scopus | eid_2-s2.0-0036847554 | en_HK |
dc.identifier.hkuros | 76701 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0036847554&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 86 | en_HK |
dc.identifier.issue | 2 | en_HK |
dc.identifier.spage | 381 | en_HK |
dc.identifier.epage | 407 | en_HK |
dc.identifier.isi | WOS:000178979600011 | - |
dc.publisher.place | United States | en_HK |
dc.identifier.scopusauthorid | Ding, G=7201791806 | en_HK |
dc.identifier.scopusauthorid | Zang, W=7005740804 | en_HK |
dc.identifier.citeulike | 36787 | - |
dc.identifier.issnl | 0095-8956 | - |