100 search results - page 13 / 20 » Coloring powers of planar graphs |
115
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Every-day, the postal sorting systems diffuse several tons of mails. It is noted that the principal origin of mail rejection is related to the failure of address-block localizatio...
130
click to vote
AAAI
1997
15 years 5 months ago
1997
Constraint satisfaction research has focussed on consistency checking using k-consistency and its variations such as arc-consistency, and path-consistency. We define a new form of...
166
click to vote
COMBINATORICA
2010
14 years 11 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
165
click to vote
DM
2011
14 years 11 months ago
2011
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
168
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...