<?xml version="1.0" encoding="UTF-8"?>

<record version="5" id="475">
 <title>Hamiltonian path</title>
 <name>HamiltonianPath</name>
 <created>2001-10-24 13:08:26</created>
 <modified>2006-10-23 15:04:46</modified>
 <type>Definition</type>
 <creator id="3" name="drini"/>
 <author id="6075" name="rspuzio"/>
 <author id="3" name="drini"/>
 <classification>
	<category scheme="msc" code="05C45"/>
 </classification>
 <related>
	<object name="HamiltonianCycle"/>
	<object name="HamiltonianGraph"/>
	<object name="PetersensGraph"/>
	<object name="Traceable"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{graphicx}
\usepackage{xypic}</preamble>
 <content>Let $G$ be a graph. A path on $G$ that includes every vertex exactly once is called a \emph{Hamiltonian path}.</content>
</record>
