On the boolean dimension of a graph and other related parameters

HIGHLIGHTS

• who: DMTCS vol. and colleagues from the UnivUniversity of Calgary, Calgary, Alberta, Canada have published the article: On the Boolean dimension of a graph and other related parameters, in the Journal: (JOURNAL)
• what: The authors show that G is isomorphic to an induced subgraph of O(E)u00acu0096, where E is the set and amp;lt;u03c9 of finite subsets of u03ba, augmented of an extra element r. The authors show that there is a nice combinatorial interpretation for the Boolean dimension of trees. The authors show that any optimal star decomposition of T in . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.