On hamiltonicity of 1-tough triangle-free graphs

On hamiltonicity of 1-tough triangle-free graphs

<p><span>Let </span><span class="math inline"><em>ω</em>(<em>G</em>)</span><span> denote the number of components of a graph G. A connected graph G is said to be 1-tough if </span><span class="math inline">&l...

Full description

Bibliographic Details
Main Authors: Wei Zheng, Hajo Broersma, Ligong Wang
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2021-10-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
toughness
1-tough
forbidden subgraph
hamiltonicity
triangle-free graph
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/873

Internet

https://www.ejgta.org/index.php/ejgta/article/view/873

Similar Items