316 search results - page 37 / 64 » The chromatic covering number of a graph |
DM
2010
14 years 12 months ago
2010
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour cl...
106
click to vote
DM
2007
14 years 11 months ago
2007
We study properties of the sets of minimal forbidden minors for the families of graphs having a vertex cover of size at most k. We denote this set by O(k-VERTEX COVER) and call it...
105
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—We consider the question of obtaining tight delay guarantees for throughout-optimal link scheduling in arbitrary topology wireless ad-hoc networks. We consider two classes of sc...
114
click to vote
STOC
2005
ACM
16 years 3 days ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
DM
2000
14 years 11 months ago
2000
We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n-vertex graph.