On a hamiltonian cycle in which specified vertices are not isolated

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

研究成果: Article査読

1 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)X85-91
ジャーナルDiscrete Mathematics
258
1-3
DOI
出版ステータスPublished - 2002 12 6

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

フィンガープリント 「On a hamiltonian cycle in which specified vertices are not isolated」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル