On the Isometric Path Partition Problem
The isometric path cover (partition) problem of a graph consists of finding a minimum set of isometric paths which cover (partition) the vertex set of the graph. The isometric path cover (partition) number of a graph is the cardinality of a minimum isometric path cover (partition). We prove that the...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
University of Zielona Góra
2021-11-01
|
| Serie: | Discussiones Mathematicae Graph Theory |
| Soggetti: | |
| Accesso online: | https://doi.org/10.7151/dmgt.2236 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|