836 search results - page 46 / 168 » Orthogonal Colorings of Graphs |
112
click to vote
ICIAR
2005
Springer
15 years 9 months ago
2005
Springer
A method for color indexing is proposed that is based upon nonparametric statistical techniques. Nonparametrics compare the ordinal rankings of sample populations, and maintain the...
136
click to vote
ENDM
2008
15 years 4 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
138
click to vote
ICNP
2006
IEEE
15 years 10 months ago
2006
IEEE
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
136
click to vote
COCOON
2003
Springer
15 years 9 months ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
131
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...