Induced Nets and Hamiltonicity of Claw-Free Graphs

Shuya Chiba, Jun Fujisawa

研究成果: Article査読

1 被引用数 (Scopus)


The connected graph of degree sequence 3, 3, 3, 1, 1, 1 is called a net, and the vertices of degree 1 in a net are called its endvertices. Broersma conjectured in 1993 that a 2-connected graph G with no induced K1 , 3 is hamiltonian if every endvertex of each induced net of G has degree at least (| V(G) | - 2) / 3. In this paper we prove this conjecture in the affirmative.

ジャーナルGraphs and Combinatorics
出版ステータスAccepted/In press - 2021

ASJC Scopus subject areas

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


「Induced Nets and Hamiltonicity of Claw-Free Graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。