Search results
Results From The WOW.Com Content Network
Every biconnected 3-regular graph with n vertices has O(2 n/2) 3-edge-colorings; all of which can be listed in time O(2 n/2) (somewhat slower than the time to find a single coloring); as Greg Kuperberg observed, the graph of a prism over an n/2-sided polygon has Ω(2 n/2) colorings (lower instead of upper bound), showing that this bound is ...
In 2011, the operator planned to disburse $35 million for building a new Discovery World theme park. A 2-hectare area was to be built and it was predicted to be operated before the end of 2012. It would serve 100 venues/rides and was predicted to attract 1.2 million visitors from Indonesia and Southeast Asia.