On the Cyclability of k-Connected (k+1)-Regular Graphs.

Abstract

In the past fifteen years or so, there have been quite a number of papers dealing with variations on the following general theme. Given a graph G and a positive integer m, m < or = /V(G), find non-trivial conditions on G which will guarantee that given a set S = (v sub 1,..., v sub m) - V(G), there exists a cycle C sub S containing S. In the special case m = /V(G), this documents deals with conditions for the existence of Hamiltonian cycles, in itself a subject studied extensively by many graph theorists.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1986
Accession Number
ADA178270

Entities

People

  • D. A. Holton
  • M. D. Plummer

Organizations

  • Vanderbilt University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Construction
  • Coverings
  • Guarantees
  • Mathematics
  • Mirrors
  • New Zealand
  • Point Theorem
  • Reflection
  • Symmetry
  • Tennessee
  • Universities

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.
  • Strategic Security Studies
  • Systems Analysis and Design