File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Acyclic edge coloring of planar graphs without cycles of specific lengths

TitleAcyclic edge coloring of planar graphs without cycles of specific lengths
Authors
KeywordsAcyclic edge coloring
Combinatorial problems
Forbidden cycles
Planar graphs
Issue Date2011
Citation
Journal of Applied Mathematics and Computing, 2011, v. 37, p. 533-540 How to Cite?
Persistent Identifierhttp://hdl.handle.net/10722/220462
ISSN
2023 Impact Factor: 2.4
2023 SCImago Journal Rankings: 0.659
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorGao, Y-
dc.contributor.authorYu, D-
dc.date.accessioned2015-10-16T06:43:08Z-
dc.date.available2015-10-16T06:43:08Z-
dc.date.issued2011-
dc.identifier.citationJournal of Applied Mathematics and Computing, 2011, v. 37, p. 533-540-
dc.identifier.issn1598-5865-
dc.identifier.urihttp://hdl.handle.net/10722/220462-
dc.languageeng-
dc.relation.ispartofJournal of Applied Mathematics and Computing-
dc.subjectAcyclic edge coloring-
dc.subjectCombinatorial problems-
dc.subjectForbidden cycles-
dc.subjectPlanar graphs-
dc.titleAcyclic edge coloring of planar graphs without cycles of specific lengths-
dc.typeArticle-
dc.identifier.emailYu, D: mxyu@hku.hk-
dc.identifier.doi10.1007/s12190-010-0448-x-
dc.identifier.scopuseid_2-s2.0-80052618376-
dc.identifier.hkuros255635-
dc.identifier.volume37-
dc.identifier.spage533-
dc.identifier.epage540-
dc.identifier.eissn1865-2085-
dc.identifier.isiWOS:000213160200032-
dc.identifier.issnl1598-5865-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats