<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Some problems in Cayley graphs and computational approaches⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Kolja Knauer</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Universitat de Barcelona</institution>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This talk is about Cayley graphs of semigroups, monoids, and groups. The main type of question is which type of graphs arise as (underlying simple) graphs of Cayley graphs. We will present several results and open questions regarding classes of Cayley graph of monoids and discuss how to use combinatorial properties in order to verifiy computationally if a graph is a Cayley graph. If time permits we will additionally talk about chromatic number of Cayley graphs of groups.</p>
      </abstract>
    </article-meta>
  </front>
  <body />
  <back>
    <ref-list />
  </back>
</article>