4171 search results - page 209 / 835 » Choice numbers of graphs |
169
click to vote
ACL
2006
15 years 8 months ago
2006
An unsupervised part-of-speech (POS) tagging system that relies on graph clustering methods is described. Unlike in current state-of-the-art approaches, the kind and number of dif...
160
click to vote
CIC
2004
15 years 8 months ago
2004
Hexagonal mesh and torus, as well as honeycomb and certain other pruned torus networks, are known to belong to the class of Cayley graphs which are node-symmetric and possess othe...
150
click to vote
SLP
1997
15 years 8 months ago
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
160
click to vote
EJC
2008
15 years 6 months ago
2008
Wang and Lih conjectured that for every g 5, there exists a number M(g) such that the square of a planar graph G of girth at least g and maximum degree M(g) is (+1)-colorable. ...
178
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to...