4171 search results - page 182 / 835 » Choice numbers of graphs |
159
click to vote
ENDM
2000
15 years 6 months ago
2000
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...
149
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
190
Voted
ENDM
2002
15 years 6 months ago
2002
Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...
212
click to vote
PROPERTYTESTING
2010
15 years 4 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
187
Voted
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells. In each vertex we have a certain nu...