Publication: Hamiltonian Path Decomposition of Fan Graphs
| dc.contributor.author | Mustafa Demir | |
| dc.contributor.author | Semih Piri | |
| dc.date.accessioned | 2026-05-25T10:14:22Z | |
| dc.date.issued | 2026-01-01 | |
| dc.description.abstract | This 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.uri | https://doi.org/10.2298/aadm251124004d | |
| dc.identifier.doi | 10.2298/aadm251124004d | |
| dc.identifier.endpage | 4 | |
| dc.identifier.issn | 1452-8630 | |
| dc.identifier.startpage | 4 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12597/44104 | |
| dc.publisher | National Library of Serbia | |
| dc.relation.ispartof | Applicable Analysis and Discrete Mathematics | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.title | Hamiltonian Path Decomposition of Fan Graphs | |
| dc.type | Article | |
| dspace.entity.type | Publication | |
| local.import.source | OpenAire | |
| local.indexed.at | OpenAire |
