Forbidden subgraphs and the existence of paths and cycles passing through specified vertices

Jun Fujisawa, Katsuhiro Ota, Takeshi Sugiyama, Masao Tsugaki

研究成果: Article査読

2 被引用数 (Scopus)

抄録

In [H. Broersma, H. Li, J. Li, F. Tian, H.J. Veldman, Cycles through subsets with large degree sums, Discrete Math. 171 (1997) 43-54], Duffus et al. showed that every connected graph G which contains no induced subgraph isomorphic to a claw or a net is traceable. They also showed that if a 2-connected graph G satisfies the above conditions, then G is hamiltonian. In this paper, modifying the conditions of Duffus et al.'s theorems, we give forbidden structures for a specified set of vertices which assures the existence of paths and cycles passing through these vertices.

本文言語English
ページ(範囲)6111-6114
ページ数4
ジャーナルDiscrete Mathematics
308
24
DOI
出版ステータスPublished - 2008 12 28

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • 離散数学と組合せ数学

フィンガープリント

「Forbidden subgraphs and the existence of paths and cycles passing through specified vertices」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル