Research Reports from the Department of Operations

Daniel Solow

Document Type

Report

Publication Date

5-1-1978

Abstract

The main theorem gives necessary and sufficient conditions for graphs having an even number of vertices to be Hamiltonian in terms of its perfect matchings. This result can be used to determine that certain graphs are not Hamiltonian because they do not contain a perfect matching. A sufficient condition for a graph on an odd number of vertices to be Hamiltonian is also presented.

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. 439

Rights

This work is in the public domain and may be freely downloaded for personal or academic use

Download

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.