1749 search results - page 46 / 350 » Conditional colorings of graphs |
115
click to vote
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
133
click to vote
APAL
1998
15 years 3 months ago
1998
A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...
133
Voted
COMBINATORICS
2000
15 years 3 months ago
2000
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...
119
click to vote
IPL
1998
15 years 3 months ago
1998
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...
104
click to vote
SCAM
2007
IEEE
15 years 10 months ago
2007
IEEE
Program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express mo...