3211 search results - page 148 / 643 » On the Grundy Number of a Graph |
191
click to vote
BMCBI
2011
15 years 28 days ago
2011
Background: The number of gene sequences that are available for comparative genomics approaches is increasing extremely quickly. A current challenge is to be able to handle this h...
172
click to vote
DM
2010
15 years 6 months ago
2010
A 2-cover is a multiset of subsets of [n] := {1, 2, . . . , n} such that each element of [n] lies in exactly two of the subsets. A 2-cover is called proper if all of the subsets o...
184
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
Chung and Ross (SIAM J. Comput., 20, 1991) conjectured that the minimum number m(n, r) of middle-state switches for the symmetric 3-stage Clos network C(n, m(n, r), r) to be rearr...
143
click to vote
ENDM
2008
15 years 6 months ago
2008
The nth crossing number of a graph G, denoted crn(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a > b &g...
163
click to vote
JCT
2006
15 years 6 months ago
2006
Erdos posed the problem of finding conditions on a graph G that imply t(G) = b(G), where t(G) is the largest number of edges in a triangle-free subgraph and b(G) is the largest nu...