DescriptionGraph K3 3.svg Deutsch: Bipartiter Graph mit je 3 Knoten in beiden Teilmengen English: Bipartite graph with 3 nodes into two subsets This image...
DescriptionGraph K3-3.svg Čeština: Bipartitní graf K3, 3 s barevně odlišenými partitami. Date 12 August 2006 Source according to w:cs:Soubor:Graf_K3-3.png by...
Complete graph K3.svg] licensed with PD-shape 2006-01-14T07:06:45Z Dbenbenn 10352x10352 (769 Bytes) by me, PD Complete bipartite graph K3,1.svg licensed...
This graph was created with the following dot source: graph G { edge [len=2] node [label="",shape=circle,style=filled,fillcolor=white] 1--2 1--3 2--3 } The...
refer to de.wikipedia. 2003-09-14 23:36 Head 141×141× (2584 bytes) Biparter Graph mit je 3 Knoten in beiden Teilmengen, selbstgezeichnet, GFDL English...
DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> <svg version = "1.1" id = "Ramsey_theory_K5_no_mono_K3" xmlns...
Derivative works of this file: Whitneys theorem exception.svg English determination method: SHA-1...
W3C-validity not checked. This graph was created with the following neato source: graph G { edge [len=2,penwidth=1.5] node [label="",shape=point,width=...
Wie diese (siehe die Lizenzerklärung dort) steht sie unter der CC-by-sa 3.0-Lizenz. Für eingelesene Bilder können die Einzellizenzen davon abweichen...
S)/NN); f[2, t_, S_, I_, R_] := (β I S)/NN - γ I; f[3, t_, S_, I_, R_] := γ I; Clear[t, k1, k2, k3, k4, w]; t[i_] := a + i*h; For[i = 1, i <= m, i++, w[i...
