@article{(Open Science Index):https://publications.waset.org/pdf/10009345,
	  title     = {On Chvátal’s Conjecture for the Hamiltonicity of  1-Tough Graphs and Their Complements},
	  author    = {Shin-Shin Kao and  Yuan-Kang Shih and  Hsun Su},
	  country	= {},
	  institution	= {},
	  abstract     = {In this paper, we show that the conjecture of Chv tal, which states that any 1-tough graph is either a Hamiltonian graph or its complement contains a specific graph denoted by F, does not hold in general. More precisely, it is true only for graphs with six or seven vertices, and is false for graphs with eight or more vertices. A theorem is derived as a correction for the conjecture.
},
	    journal   = {International Journal of Mathematical and Computational Sciences},
	  volume    = {12},
	  number    = {1},
	  year      = {2018},
	  pages     = {20 - 23},
	  ee        = {https://publications.waset.org/pdf/10009345},
	  url   	= {https://publications.waset.org/vol/133},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 133, 2018},
	}