751 search results - page 40 / 151 » The Distinguishing Chromatic Number |
107
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
119
click to vote
COMBINATORICA
2008
15 years 25 days ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
110
Voted
JGT
2008
15 years 22 days ago
2008
An edge-operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs G, the editing distance fro...
129
Voted
BMCBI
2011
14 years 4 months ago
2011
Background: Using microarray and sequencing platforms, a large number of copy number variations (CNVs) have been identified in humans. In practice, because our human genome is a d...
109
Voted
TCS
2008
15 years 19 days ago
2008
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...