Back to matchesWe found a matchYour institution may have access to this item. Find your institution then sign in to continue.TitleOn Toughness and Hamiltonicity of 2 K<sub>2</sub>-Free Graphs.AuthorsBroersma, Hajo; Patel, Viresh; Pyatkin, ArtemAbstractThe toughness of a (noncomplete) graph G is the minimum value of t for which there is a vertex cut A whose removal yieldsSubjectsGRAPH theory; HAMILTON spaces; STATISTICS; COMBINATORICS; MATHEMATICAL programmingPublicationJournal of Graph Theory, 2014, Vol 75, Issue 3, p244ISSN0364-9024Publication typeArticleDOI10.1002/jgt.21734