Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
Highly Hamiltonian Graphs And Digraphs, Zhenming Bi
Highly Hamiltonian Graphs And Digraphs, Zhenming Bi
Dissertations
A cycle that contains every vertex of a graph or digraph is a Hamiltonian cycle. A graph or digraph containing such a cycle is itself called Hamiltonian. This concept is named for the famous Irish physicist and mathematician Sir William Rowan Hamilton. These graphs and digraphs have been the subject of study for over six decades. In this dissertation, we study graphs and digraphs with even stronger Hamiltonian properties, namely highly Hamiltonian graphs and digraphs.
Chromatic Connectivity Of Graphs, Elliot Laforge