1952 search results - page 213 / 391 » Complete partitions of graphs |
172
click to vote
ERCIMDL
2010
Springer
15 years 7 months ago
2010
Springer
Invenio is the web-based integrated digital library system developed at CERN. Within this framework, we present four types of ranking models based on the citation graph that comple...
152
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Non-adaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question...
167
click to vote
DM
2008
15 years 6 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
174
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
190
click to vote
EJC
2008
15 years 6 months ago
2008
The adaptable chromatic number of a graph G is the smallest integer k such that for any edge k-colouring of G there exists a vertex kcolouring of G in which the same colour never ...