Accession Number : ADA266196


Title :   Homogeneously Traceable Results in Claw-Free Graphs


Corporate Author : VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS


Personal Author(s) : Markus, Lisa R


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/a266196.pdf


Report Date : Jun 1993


Pagination or Media Count : 28


Abstract : A graph is homogeneously traceable if for each v in V(C) there is a Hamilton path starting at v. In this paper we find a sufficient condition for a claw-free graph to be homogeneously traceable in terms of a neighborhood union condition. Hamilton path, Neighborhood union.


Descriptors :   *GRAPHS , *PATHS , *MAPPING , STARTING , HAMILTONIAN FUNCTIONS


Subject Categories : Theoretical Mathematics


Distribution Statement : APPROVED FOR PUBLIC RELEASE