On covering the points of a graph with point disjoint paths

Publisher Website

1 January 1974

book chapter
Published by Springer Nature in Lecture Notes in Mathematics

p. 201-212
https://doi.org/10.1007/bfb0066442

Abstract

No abstract available

Keywords

THE MINIMUM NUMBER OF POINT DISJOINT PATHS WHICH COVER ALL THE POINTS OF A

This publication has 8 references indexed in Scilit:

On the hamiltonian completion problem
Lecture Notes in Mathematics, 1974
On Hamilton's ideals
Journal of Combinatorial Theory, Series B, 1972
EVOLUTION OF THE PATH NUMBER OF A GRAPH: COVERING AND PACKING IN GRAPHS, II††This research was supported in part by a grant to the Research Center for Group Dynamics of the University of Michigan from the NIH Biomedical Sciences Division.
Published by Elsevier ,1972
COVERING AND PACKING IN GRAPHS, I.
Annals of the New York Academy of Sciences, 1970
A formal system for information retrieval from files
Communications of the ACM, 1970
GRAPH THEORY
Published by Defense Technical Information Center (DTIC) ,1969
Trees in Polyhedral Graphs
Canadian Journal of Mathematics, 1966
Arc coverings of graphs
Annali di Matematica Pura ed Applicata (1923 -), 1961