Treffer: RECOGNIZING THE HAMILTONIAN GRAPH WITH IS AN EASY PROBLEM

Title:
RECOGNIZING THE HAMILTONIAN GRAPH WITH IS AN EASY PROBLEM
Authors:
Nhu, An D
Source:
International Journal of Advanced Research in Computer Science; Vol. 10 No. 2 (2019): March-April 2019; 42-45 ; 0976-5697 ; 10.26483/ijarcs.v10i2
Publisher Information:
International Journal of Advanced Research in Computer Science
Publication Year:
2019
Subject Terms:
Hamiltonian cycle, Hamiltonian graph, 1-tough graph, polynomial algorithm
Document Type:
Fachzeitschrift article in journal/newspaper<br />report
File Description:
application/pdf
Language:
English
Relation:
http://www.ijarcs.info/index.php/Ijarcs/article/view/6403/5176; http://www.ijarcs.info/index.php/Ijarcs/article/view/6403
DOI:
10.26483/ijarcs.v10i2.6403
Availability:
http://www.ijarcs.info/index.php/Ijarcs/article/view/6403
https://doi.org/10.26483/ijarcs.v10i2.6403
Rights:
Copyright (c) 2019 International Journal of Advanced Research in Computer Science
Accession Number:
edsbas.9398F52E
Database:
BASE

Weitere Informationen

Let  be an undirected and single graph on  vertices with , i.e., the degree sum of any two non-adjacent vertices in  is equal to . We show that, recognizing the whether or not  is a Hamiltonian graph can be done in polynomial time.Â