Research Reports from the Department of Operations
Document Type
Report
Publication Date
5-1-1978
Abstract
A new proof technique for showing certain graphs are Hamiltonian is presented. One assumes G to be non-Hamiltonian and derives a contradiction by showing that a largest cycle of G can be strictly increased in length. The results are that if certain theta subgraphs do not appear in G then G is Hamiltonian.
Keywords
Operations research, Graph theory, Hamiltonian graph theory, Proof theory, Graph algorithms
Publication Title
Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 440
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Solow, Daniel, "On Forbidden Theta Subgraphs of Non-Hamiltonian 2-Connected Graphs" (1978). Research Reports from the Department of Operations. 356.
https://commons.case.edu/wsom-ops-reports/356