1208 search results - page 16 / 242 » On Counting Generalized Colorings |
MM
2010
ACM
13 years 8 months ago
2010
ACM
We provide an efficient technique of color and luminance compensation for sequences of overlapping images. It can be used in construction of high-resolution and high-quality panor...
ENDM
2007
13 years 7 months ago
2007
Fix a family T of 3-connected graphs, and let G be the class of graphs whose 3connected components are the graphs in T . We present a general framework for analyzing such graph cl...
FOSSACS
2010
Springer
14 years 2 months ago
2010
Springer
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...
EJC
2006
13 years 7 months ago
2006
The problem of counting plane trees with n edges and an even or an odd number of leaves has been recently studied by Eu, Liu and Yeh, in connection with an identity on coloring ne...
DM
2010
13 years 7 months ago
2010
A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex colorings using four colors o...