User contributions for Beth Ann

11 August 2009

• 12:4612:46, 11 August 2009 diff hist 0‎ m Talk:Main Page ‎No edit summary

16 July 2009

• 12:2612:26, 16 July 2009 diff hist +52‎ König's Lemma ‎No edit summary

29 June 2009

• 17:1817:18, 29 June 2009 diff hist +321‎ N Definition:Eulerian Circuit ‎ Created page with 'An '''Eulerian circuit''' is a circuit that passes through every vertex of a [[Definition:Gra…'
• 17:1817:18, 29 June 2009 diff hist −211‎ Definition:Eulerian Graph ‎No edit summary
• 17:1617:16, 29 June 2009 diff hist +1‎ m Definition:Hamiltonian Graph ‎No edit summary
• 17:1617:16, 29 June 2009 diff hist +37‎ Definition:Hamiltonian Graph ‎No edit summary
• 17:1517:15, 29 June 2009 diff hist +323‎ N Definition:Hamilton Cycle ‎ Created page with 'A '''Hamilton cycle''' in a graph is a cycle that contains every [[Definition:Graph (Graph Theory) #V…'
• 17:1517:15, 29 June 2009 diff hist −250‎ Definition:Hamiltonian Graph ‎No edit summary
• 16:2116:21, 29 June 2009 diff hist +31‎ Definition:Multigraph ‎No edit summary
• 16:2116:21, 29 June 2009 diff hist 0‎ N File:Multigraph.png ‎No edit summary
• 16:0816:08, 29 June 2009 diff hist +207‎ N Definition:Subgraph ‎ Created page with 'A graph <math>H=(V(H),E(H))</math> is called a '''subgraph''' of a graph <math>G=(V(G),E(G))</math> if <math>V(H)\subseteq V(G)</math> and <ma…'
• 16:0716:07, 29 June 2009 diff hist +352‎ N Definition:Hamiltonian Graph ‎ Created page with 'A '''Hamilton cycle''' in a graph is a cycle that contains every [[Definition:Graph (Graph Theory) #V…'
• 16:0716:07, 29 June 2009 diff hist +2,336‎ N Dirac's Theorem ‎ Created page with '==Theorem== If a connected graph <math>G</math> has <math>n\geq 3</math> vertices and the [[Definition…'
• 16:0516:05, 29 June 2009 diff hist +1,124‎ N Cycle does not Contain Subcycles ‎ Created page with '==Theorem== If a graph <math>G</math> is a cycle, then the only cycle that is a [[Definition:Subgrap…'
• 13:2813:28, 29 June 2009 diff hist +182‎ User talk:Prime.mover ‎No edit summary

28 June 2009

• 12:1412:14, 28 June 2009 diff hist +389‎ N Definition:Eulerian Graph ‎ Created page with 'A '''Eulerian circuit''' is a circuit that passes through every vertex of a [[Definition:Grap…'
• 12:1012:10, 28 June 2009 diff hist +520‎ N Definition:Isomorphism (Graph Theory) ‎ Created page with 'Two graphs, <math>G=(V(G),E(G))</math> and <math>H=(V(H),E(G))</math> are '''isomorphic''', denoted <math>G\cong H</math>, if there exists a […'
• 12:0412:04, 28 June 2009 diff hist +1‎ Definition:Connected (Graph Theory) ‎No edit summary
• 12:0112:01, 28 June 2009 diff hist +251‎ N Definition:Connected (Graph Theory) ‎ Created page with 'A graph is called '''connected''' if there is a walk between any pair of [[Definition:Graph (Graph Theory) #Vertex|vertice…'
• 11:5711:57, 28 June 2009 diff hist +27‎ Characteristics of Eulerian Graph ‎No edit summary
• 11:5211:52, 28 June 2009 diff hist −24‎ Definition:Walk (Graph Theory) ‎ →‎Trail and Paths
• 11:5111:51, 28 June 2009 diff hist +911‎ N Definition:Walk (Graph Theory) ‎ Created page with 'A '''walk''' on a graph is an alternating series of vertices and [[Definition:Graph (Graph Theory)…'
• 11:4311:43, 28 June 2009 diff hist +2,587‎ N Characteristics of Eulerian Graph ‎ Created page with '== Theorem == A finite graph is Eulerian if and only if it is connected and each…'

26 June 2009

• 13:5613:56, 26 June 2009 diff hist +548‎ Definition:Graph (Graph Theory) ‎No edit summary
• 12:1012:10, 26 June 2009 diff hist +463‎ N Definition:Multigraph ‎ Created page with 'A '''multigraph''' is a graph that can have more than one edge between a pair of [[Definition:Graph (…'
• 11:5911:59, 26 June 2009 diff hist 0‎ Handshake Lemma ‎No edit summary
• 11:4911:49, 26 June 2009 diff hist −11‎ Five Color Theorem ‎ →‎Proof