Homogeneously Traceable Results in Claw-Free Graphs

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1993
Accession Number
ADA266196

Entities

People

  • Lisa R. Markus

Organizations

  • Vanderbilt University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Classification
  • Contracts
  • Geometry
  • Mathematics
  • Military Research
  • Security
  • Triangles
  • Universities

Fields of Study

  • Mathematics

Readers

  • Astronomy and Astrophysics.
  • Electrochemical Surface Science
  • Mathematical Modeling and Probability Theory.