Publication:
Decomposing complete equipartite graphs into short even cycles

Simple item page
dc.contributor.coauthorCavenagh, Nicholas J.
dc.contributor.departmentDepartment of Mathematics
dc.contributor.kuauthorSmith, Benjamin R.
dc.contributor.kuprofileResearcher
dc.contributor.otherDepartment of Mathematics
dc.contributor.schoolcollegeinstituteCollege of Sciences
dc.contributor.yokidN/A
dc.date.accessioned2024-11-09T22:57:44Z
dc.date.issued2011
dc.description.abstractIn this article we find necessary and sufficient conditions to decompose a complete equipartite graph into cycles of uniform length, in the case that the length is both even and short relative to the number of parts.
dc.description.indexedbyWoS
dc.description.indexedbyScopus
dc.description.issue2
dc.description.openaccessNO
dc.description.publisherscopeInternational
dc.description.volume19
dc.identifier.doi10.1002/jcd.20265
dc.identifier.eissn1520-6610
dc.identifier.issn1063-8539
dc.identifier.quartileQ3
dc.identifier.scopus2-s2.0-79951934965
dc.identifier.urihttp://dx.doi.org/10.1002/jcd.20265
dc.identifier.urihttps://hdl.handle.net/20.500.14288/7594
dc.identifier.wos287676300004
dc.keywordsGraph decomposition
dc.keywordsCycle
dc.keywordsComplete equipartite graph
dc.keywordsOberwolfach problem
dc.keywordsPath
dc.languageEnglish
dc.publisherWiley
dc.sourceJournal of Combinatorial Designs
dc.subjectMathematics
dc.titleDecomposing complete equipartite graphs into short even cycles
dc.typeJournal Article
dspace.entity.typePublication
local.contributor.authoridN/A
local.contributor.kuauthorSmith, Benjamin R.
relation.isOrgUnitOfPublication2159b841-6c2d-4f54-b1d4-b6ba86edfdbe
relation.isOrgUnitOfPublication.latestForDiscovery2159b841-6c2d-4f54-b1d4-b6ba86edfdbe

Files

Collections

Publications without Fulltext