953 resultados para Extremal graphs
Resumo:
Extra t.p. with thesis statement inserted.
Resumo:
Includes bibliographical references.
Resumo:
Includes bibliographies.
Resumo:
At head of title: "Wave Information Studies of U.S. Coastlines."
Resumo:
"This research was performed under an agreement between the U.S. Weather Bureau and the U.S. Atomic Energy Commission."
Resumo:
"NOAA--S/T 77-2535"
Resumo:
"US GeoData"--Cover.
Resumo:
Mode of access: Internet.
Resumo:
"Prepared ... for the U.S. Navy Bureau of Aeronautics, under contract NOas 57-585-c."
Resumo:
"Part of this work done under ARPA Order 631, Program Code No. 5820."
Resumo:
Mode of access: Internet.
Resumo:
Mode of access: Internet.
Resumo:
Mode of access: Internet.
Resumo:
Bibliography: p. 207-210.
Resumo:
Let K(r, s, t) denote the complete tripartite graph with partite sets of size r, s and t, where r less than or equal to s less than or equal to t. Let D be the graph consisting of a triangle with an edge attached. We show that K(r, s, t) may be decomposed into copies of D if and only if 4 divides rs + st + rt and t less than or equal to 3rs/(r + s).