Some characterizations of Eulerian and Hamiltonian graphs
The thesis is an exposition of some characterization of Eulerian and Hamiltonian graphs. It discusses the definitions of an Eulerian graph, Hamiltonian graph and examples, a necessary and sufficient condition for a graph to be Eulerian, a necessary and sufficient condition for a graph to be edge-tra...
Saved in:
Main Authors: | , |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2006
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/17428 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-17941 |
---|---|
record_format |
eprints |
spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-179412022-02-03T03:30:45Z Some characterizations of Eulerian and Hamiltonian graphs Andrada, Philip Gabriel Y. Ong, Hans Vernie L. The thesis is an exposition of some characterization of Eulerian and Hamiltonian graphs. It discusses the definitions of an Eulerian graph, Hamiltonian graph and examples, a necessary and sufficient condition for a graph to be Eulerian, a necessary and sufficient condition for a graph to be edge-traceable, the Fleury's algorithms and its justification, and sufficient conditions for a graph to be Hamiltonian. 2006-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/17428 Bachelor's Theses English Animo Repository Eulerian graph theory |
institution |
De La Salle University |
building |
De La Salle University Library |
continent |
Asia |
country |
Philippines Philippines |
content_provider |
De La Salle University Library |
collection |
DLSU Institutional Repository |
language |
English |
topic |
Eulerian graph theory |
spellingShingle |
Eulerian graph theory Andrada, Philip Gabriel Y. Ong, Hans Vernie L. Some characterizations of Eulerian and Hamiltonian graphs |
description |
The thesis is an exposition of some characterization of Eulerian and Hamiltonian graphs. It discusses the definitions of an Eulerian graph, Hamiltonian graph and examples, a necessary and sufficient condition for a graph to be Eulerian, a necessary and sufficient condition for a graph to be edge-traceable, the Fleury's algorithms and its justification, and sufficient conditions for a graph to be Hamiltonian. |
format |
text |
author |
Andrada, Philip Gabriel Y. Ong, Hans Vernie L. |
author_facet |
Andrada, Philip Gabriel Y. Ong, Hans Vernie L. |
author_sort |
Andrada, Philip Gabriel Y. |
title |
Some characterizations of Eulerian and Hamiltonian graphs |
title_short |
Some characterizations of Eulerian and Hamiltonian graphs |
title_full |
Some characterizations of Eulerian and Hamiltonian graphs |
title_fullStr |
Some characterizations of Eulerian and Hamiltonian graphs |
title_full_unstemmed |
Some characterizations of Eulerian and Hamiltonian graphs |
title_sort |
some characterizations of eulerian and hamiltonian graphs |
publisher |
Animo Repository |
publishDate |
2006 |
url |
https://animorepository.dlsu.edu.ph/etd_bachelors/17428 |
_version_ |
1772835280545382400 |