523 search results - page 57 / 105 » Decidability of string graphs |
136
Voted
ALGORITHMICA
2006
15 years 3 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...
152
click to vote
EJC
2008
15 years 3 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 ...
115
click to vote
APWEB
2010
Springer
15 years 8 months ago
2010
Springer
—Extensive research has been conducted on top of online social networks (OSNs), while little attention has been paid to the data collection process. Due to the large scale of OSN...
130
click to vote
DAM
2010
15 years 3 months ago
2010
An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph G is the minimum number of equivalence subgraphs needed to cover the edges of G. W...
117
Voted
GD
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...