this is for holding javascript data
Rikki edited In_addition_there_are_a__.html
about 8 years ago
Commit id: eb04a08a3be9d2f0b288f18008468b5be95c31fb
deletions | additions
diff --git a/In_addition_there_are_a__.html b/In_addition_there_are_a__.html
index 36afce1..7fda05b 100644
--- a/In_addition_there_are_a__.html
+++ b/In_addition_there_are_a__.html
...
In addition, there are a few different types of graphs including Eulerian graphs and Hamiltonian graphs. A graph is Eulerian if it is connected and \(G\) contains a closed trial with the use of every edge exactly once. Within Eulerian graphs, one can begin and end with any vertex. A graph is Hamiltonian
if it contains a cycle that goes through every vertex.
