File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Packing cycles in graphs, II

TitlePacking cycles in graphs, II
Authors
Ding, GXu, ZZang, W
Issue Date2003
PublisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jctb
Citation
Journal Of Combinatorial Theory. Series B, 2003, v. 87 n. 2, p. 244-253 How to Cite?
DOI: http://dx.doi.org/10.1016/S0095-8956(02)00007-2
AbstractA graph G packs if for every induced subgraph H of G, the maximum number of vertex-disjoint cycles in H is equal to the minimum number of vertices whose deletion from H results in a forest. The purpose of this paper is to characterize all graphs that pack. © 2002 Elsevier Science (USA). All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/75284
ISSN
0095-8956
2023 Impact Factor: 1.2
2023 SCImago Journal Rankings: 1.793
ISI Accession Number ID
WOS:000181209100003
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorDing, Gen_HK
dc.contributor.authorXu, Zen_HK
dc.contributor.authorZang, Wen_HK
dc.date.accessioned2010-09-06T07:09:40Z-
dc.date.available2010-09-06T07:09:40Z-
dc.date.issued2003en_HK
dc.identifier.citationJournal Of Combinatorial Theory. Series B, 2003, v. 87 n. 2, p. 244-253en_HK
dc.identifier.issn0095-8956en_HK
dc.identifier.urihttp://hdl.handle.net/10722/75284-
dc.description.abstractA graph G packs if for every induced subgraph H of G, the maximum number of vertex-disjoint cycles in H is equal to the minimum number of vertices whose deletion from H results in a forest. The purpose of this paper is to characterize all graphs that pack. © 2002 Elsevier Science (USA). All rights reserved.en_HK
dc.languageengen_HK
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.titlePacking cycles in graphs, IIen_HK
dc.typeArticleen_HK
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/S0095-8956(02)00007-2en_HK
dc.identifier.scopuseid_2-s2.0-0037373981en_HK
dc.identifier.hkuros76702en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0037373981&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume87en_HK
dc.identifier.issue2en_HK
dc.identifier.spage244en_HK
dc.identifier.epage253en_HK
dc.identifier.isiWOS:000181209100003-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridDing, G=7201791806en_HK
dc.identifier.scopusauthoridXu, Z=7405423545en_HK
dc.identifier.scopusauthoridZang, W=7005740804en_HK
dc.identifier.issnl0095-8956-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats