| dc.contributor.author | Mafuta, Phillip | |
| dc.contributor.author | Mukwembi, Simon | |
| dc.contributor.author | Munyira, Sheunesu | |
| dc.date.accessioned | 2021-02-15T09:08:10Z | |
| dc.date.available | 2021-02-15T09:08:10Z | |
| dc.date.issued | 2018-08-29 | |
| dc.identifier.citation | Mafuta, P., Mukwembi, S., & Munyira, S. (2019). Spanning paths in graphs. Discrete Applied Mathematics, 255, 278-282. | en_ZW |
| dc.identifier.issn | 0166218X | |
| dc.identifier.uri | https://hdl.handle.net/10646/3962 | |
| dc.description.abstract | The Conjecture, Graffiti.pc 190, of the computer program Graffiti.pc, instructed by DeLavi˜na,
state that every simple connected graph G with minimum degree δ and leaf number L(G)
such that δ ≥ 1 2 (L(G) + 1), is traceable. Here, we prove a sufficient condition for a graph
to be traceable based on minimum degree and leaf number, by settling completely, the
Conjecture Graffiti. pc 190. We construct infinite graphs to show that our results are best
in a sense. All graphs considered are simple. That is, they neither have loops nor multiple
edges. | en_ZW |
| dc.description.sponsorship | DAAD, Germany. | en_ZW |
| dc.language.iso | en | en_ZW |
| dc.publisher | Elsevier | en_ZW |
| dc.subject | leaf number | en_ZW |
| dc.subject | minimum degree | en_ZW |
| dc.subject | traceable graphs | en_ZW |
| dc.title | Spanning paths in graphs | en_ZW |
| dc.type | Article | en_ZW |
