Hamiltonian Results in K(l,r)-Free Graphs

Abstract

A graph is $K(l,r)-free if it does not contain K(l,r) as an induced subgraph. It is claw-free if it does not contain K(1,3) as an induced subgraph. Matthews and Sumner 5 proved that every 2-connected, claw-free graph with min. degree at least (p-2)/3 is Hamiltonian. In this paper we investigate Hamilton cycles in K(l,r)-free graphs with respect to a minimum degree condition.... Claw-free, Minimum degree, Hamilton cycle.

Open PDF

Document Details

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

Entities

People

  • Lisa R. Markus

Organizations

  • Vanderbilt University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Analogs
  • Classification
  • Inequalities
  • Mathematics
  • Military Research
  • Security
  • Universities

Readers

  • Graph Algorithms and Convex Optimization.