. "Mark Norman Ellingham"@fr . "Chv\u00E1tal"@fr . "Tough graphs and Hamiltonian circuits"@fr . "316301"^^ . . . "Broersma"@fr . . "2021-02-01"^^ . . . . . "Proceedings of the 5th Twente Workshop on Graphs and Combinatorial Optimization"@fr . "Arxiv preprint"@fr . "284"^^ . . "Pouria Salehi"@fr . . "10.1007"^^ . "2020"^^ . "V\u00E1clav"@fr . "22"^^ . . . "Schmeichel"@fr . "28"^^ . "Edward"@fr . . "2008.08"^^ . "Henk Jan Veldman"@fr . "1074858"^^ . "Nowbandegani"@fr . "Amartya Banerjee"@fr . "\u0416\u0451\u0441\u0442\u043A\u043E\u0441\u0442\u044C \u0433\u0440\u0430\u0444\u0430"@ru . . . "1"^^ . "5"^^ . "Toughness in graphs\u2014a survey"@fr . "Shan"@fr . "The Toughness of Kneser Graphs"@fr . . "191"^^ . "Duret\u00E9 d'un graphe"@fr . "1990"^^ . . . "2221006"^^ . "10.1016"^^ . . . "En th\u00E9orie des graphes, la duret\u00E9 (\u00AB toughness \u00BB en anglais) est une mesure de la connexit\u00E9 d'un graphe."@fr . "6557"^^ . "En th\u00E9orie des graphes, la duret\u00E9 (\u00AB toughness \u00BB en anglais) est une mesure de la connexit\u00E9 d'un graphe."@fr . . "Douglas"@fr . "13907858"^^ . "Davin Park"@fr . "2000"^^ . . "Seifollah Louis"@fr . "2006"^^ . "317"^^ . . "1"^^ . . . . "Nathan Hayes"@fr . . "Toughness and prism-hamiltonicity of P4-free graphs"@fr . . "99"^^ . "1743840"^^ . "215"^^ . "Wiseley Wong"@fr . "201"^^ . "Graph toughness"@en . . "Tanay Wakhare"@fr . . "Not every 2-tough graph is Hamiltonian"@fr . "184606385"^^ . . . . "Bauer"@fr . "3237188"^^ . "1973"^^ . "S. L. Hakimi"@fr . . . . . . "Sebastian Cioab\u0103"@fr . . . "V\u00E1clav Chv\u00E1tal"@fr . "Hakimi"@fr . . "Songling"@fr . . . . "3"^^ . "1"^^ . "2020"^^ . "Anthony Ostuni"@fr . . "Recognizing tough graphs is NP-hard"@fr . . . "Hajo J."@fr .