4171 search results - page 98 / 835 » Choice numbers of graphs |
142
click to vote
DAM
2002
15 years 6 months ago
2002
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...
161
click to vote
WADS
2007
Springer
16 years 15 days ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
170
click to vote
EJC
2006
15 years 6 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
137
click to vote
APPML
2006
15 years 6 months ago
2006
The purpose of the paper is to provide an answer to a long standing problem to compute the distance distribution among the nodes in a star graph, i.e., to compute the exact number...
179
click to vote
ER
2008
Springer
15 years 8 months ago
2008
Springer
During data warehouse design, the designer frequently encounters the problem of choosing among different alternatives for the same design construct. The behavior of the chosen desi...