<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">

Publication:
Hamiltonian Path Decomposition of Fan Graphs

dc.contributor.authorMustafa Demir
dc.contributor.authorSemih Piri
dc.date.accessioned2026-05-25T10:14:22Z
dc.date.issued2026-01-01
dc.description.abstractThis paper focuses on Hamiltonian path decompositions of fan graphs Fm,n which is the join graph \overline{K_m} + P_n where \overline{K_m} is an empty graph with m vertices and Pn is a path with n vertices. It is proved that Fm,n admits a Hamiltonian path decomposition (possibly with a near 1-factor leave) if and only if m = n?1 for all n ? 3. The result is proved make used of the method of graph amalgamations.en
dc.description.urihttps://doi.org/10.2298/aadm251124004d
dc.identifier.doi10.2298/aadm251124004d
dc.identifier.endpage4
dc.identifier.issn1452-8630
dc.identifier.startpage4
dc.identifier.urihttps://hdl.handle.net/20.500.12597/44104
dc.publisherNational Library of Serbia
dc.relation.ispartofApplicable Analysis and Discrete Mathematics
dc.rightsinfo:eu-repo/semantics/openAccess
dc.titleHamiltonian Path Decomposition of Fan Graphs
dc.typeArticle
dspace.entity.typePublication
local.import.sourceOpenAire
local.indexed.atOpenAire

Files

Collections