JavaScript is disabled for your browser. Some features of this site may not work without it.
We are excited to announce that the repository will soon undergo an upgrade, featuring a new look and feel along with several enhanced features to improve your experience. Please be on the lookout for further updates and announcements regarding the launch date. We appreciate your support and look forward to unveiling the improved platform soon.
| dc.contributor.author | De Wet, J.P. (Johan)
|
|
| dc.contributor.author | Dunbar, Jean
|
|
| dc.contributor.author | Frick, Marietjie
|
|
| dc.contributor.author | Oellermann, Ortrud R.
|
|
| dc.date.accessioned | 2023-05-31T12:57:27Z | |
| dc.date.available | 2023-05-31T12:57:27Z | |
| dc.date.issued | 2024 | |
| dc.description.abstract | The detour order of a graph G, denoted by (G), is the order of a longest path in G. If a and b are positive integers and the vertex set of G can be partitioned into two subsets A and B such that (hAi) ≤ a and (hBi) ≤ b, we say that (A,B) is an (a, b)-partition of G. If equality holds in both instances, we call (A,B) an exact (a, b)-partition. The Path Partition Conjecture (PPC) asserts that if G is any graph and a, b any pair of positive integers such that (G) = a + b, then G has an (a, b)-partition. The Strong PPC asserts that under the same circumstances G has an exact (a, b)-partition. While a substantial body of work in support of the PPC has been developed over the past three decades, no results on the Strong PPC have yet appeared in the literature. In this paper we prove that the Strong PPC holds for a ≤ 8. | en_US |
| dc.description.department | Mathematics and Applied Mathematics | en_US |
| dc.description.librarian | am2023 | en_US |
| dc.description.sponsorship | NSERC Discovery Grant CANADA. | en_US |
| dc.description.uri | https://www.dmgt.uz.zgora.pl | en_US |
| dc.identifier.citation | De Wet, J.P., Dunbar, J., Frick, M. et al. 2023, 'On the strong path partition conjecture', Discussiones Mathematicae Graph Theory, vol. 44, no. 2, pp. 691-715, doi : 10.7151/dmgt.2468. | en_US |
| dc.identifier.issn | 1234-3099 (print) | |
| dc.identifier.issn | 2083-5892 (online) | |
| dc.identifier.other | 10.7151/dmgt.2468 | |
| dc.identifier.uri | http://hdl.handle.net/2263/90992 | |
| dc.language.iso | en | en_US |
| dc.publisher | Sciendo | en_US |
| dc.rights | © 2022 Johan P. de Wet et al. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | en_US |
| dc.subject | Strong path partition conjecture | en_US |
| dc.subject | Longest path | en_US |
| dc.title | On the strong path partition conjecture | en_US |
| dc.type | Article | en_US |
