4171 search results - page 107 / 835 » Choice numbers of graphs |
174
click to vote
EJC
2010
15 years 6 months ago
2010
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
168
click to vote
DM
2007
15 years 6 months ago
2007
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the inde...
159
click to vote
ARSCOM
2008
15 years 5 months ago
2008
A total perfect code in a graph is a subset of the graph's vertices with the property that each vertex in the graph is adjacent to exactly one vertex in the subset. We prove t...
145
click to vote
JOLLI
2006
15 years 6 months ago
2006
Applying the programming-language concept of continuations, we propose a new multimodal analysis of quantification in Type Logical Grammar. Our approach naturally gives rise to a n...
183
click to vote
SIGMOD
2005
ACM
15 years 12 months ago
2005
ACM
Recursion represents an important addition to the SQL language. This work focuses on the optimization of linear requeries in SQL. To provide an abstract framework for discussion, ...