On a hamiltonian cycle in which specified vertices are not isolated

Atsushi Kaneko, Ken Ichi Kawarabayashi, Katsuhiro Ota, Kiyoshi Yoshimoto

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

Let G be a graph with n vertices and minimum degree at least n/2, and B a set of vertices with at least 3n/4 vertices. In this paper, we show that there exists a hamiltonian cycle in which every vertex in B is adjacent to some vertex in B.

Original languageEnglish
Pages (from-to)X85-91
JournalDiscrete Mathematics
Volume258
Issue number1-3
DOIs
Publication statusPublished - 2002 Dec 6

Keywords

  • A minimum degree
  • Dirac-type condition
  • Hamiltonian cycles
  • Specifed vertices

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'On a hamiltonian cycle in which specified vertices are not isolated'. Together they form a unique fingerprint.

Cite this