803 search results - page 73 / 161 » Independence in Direct-Product Graphs |
122
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
136
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
127
click to vote
DAM
2008
15 years 4 months ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
144
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
135
click to vote
SC
2009
ACM
15 years 10 months ago
2009
ACM
Large graph analysis has become increasingly important and is widely used in many applications such as web mining, social network analysis, biology, and information retrieval. The...