Randomized Reductions and the Topology of Conjectured Classes of Uniquely Hamiltonian Graphs

We utilize the hardness of the Unambiguous-SAT problem under randomized polynomial time reductions (Valiant & Vazirani; Theoret. Comput. Sci., Vol.47, 1986) to probe the required properties of counterexamples to open non-existence conjectures for uniquely Hamiltonian graphs under various topolog...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of Information Processing 2020, Vol.28, pp.876-888
Hauptverfasser:	Barish, Robert D., Suyama, Akira
Format:	Artikel
Sprache:	eng
Schlagworte:	Bondy & Jackson conjecture Fleischner conjecture Hamiltonian cycle Sheehan conjecture Unambiguous-SAT uniquely Hamiltonian graph Valiant-Vazirani theorem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!