4171 search results - page 134 / 835 » Choice numbers of graphs |
149
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
This article is set in the eld of regulation networks modeled by discrete dynamical systems. It focuses on Boolean automata networks. In such networks, there are many ways to upd...
144
click to vote
JGT
2008
15 years 6 months ago
2008
Abstract. We answer two questions of Zhu on circular choosability of graphs. We show that the circular list chromatic number of an even cycle is equal to 2 and give an example of a...
171
click to vote
EJC
2007
15 years 6 months ago
2007
We study the notion of hypertree width of hypergraphs. We prove that, up to a constant factor, hypertree width is the same as a number of other hypergraph invariants that resemble...
147
click to vote
EI
1998
15 years 7 months ago
1998
In order to properly calibrate an electronic camera for a variety of illuminantsit is necessary to estimate the spectral sensitivity of the camera. This spectral characterisation ...
169
click to vote
COCOON
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...