Sciweavers

61 search results - page 5 / 13
» dm 2000
Sort
View
DM
2000
81views more  DM 2000»
14 years 9 months ago
The optimal pebbling number of the complete m-ary tree
In this paper, we
Hung-Lin Fu, Chin-Lin Shiue
DM
2000
80views more  DM 2000»
14 years 9 months ago
An attempt to classify bipartite graphs by chromatic polynomials
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles...
DM
2000
91views more  DM 2000»
14 years 9 months ago
Three distance theorem and grid graph
We will prove a d-dimensional version of the Geelen and Simpson theorem. c 2000 Elsevier Science B.V. All rights reserved.
Nicolas Chevallier
DM
2000
88views more  DM 2000»
14 years 9 months ago
Hamiltonian decomposition of recursive circulant graphs
The graph G(N; d) has vertex set V = {0; 1; : : : ; N - 1}, with {v; w} an edge if v - w
Daniel K. Biss
DM
2000
89views more  DM 2000»
14 years 9 months ago
On median graphs and median grid graphs
Let G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classes of Djokovi
Sandi Klavzar, Riste Skrekovski