{
  "id": "1312.3072",
  "version": "v1",
  "published": "2013-12-11T08:28:10.000Z",
  "updated": "2013-12-11T08:28:10.000Z",
  "title": "Forests and Trees among Gallai Graphs",
  "authors": [
    "Felix Joos",
    "Van Bang Le",
    "Dieter Rautenbach"
  ],
  "comment": "14 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "The Gallai graph $\\Gamma(G)$ of a graph $G$ has the edges of $G$ as its vertices and two distinct vertices $e$ and $f$ of $\\Gamma(G)$ are adjacent in $\\Gamma(G)$ if the edges $e$ and $f$ of $G$ are adjacent in $G$ but do not span a triangle in $G$. Clearly, $\\Gamma(G)$ is a subgraph of the line graph of $G$. While line graphs can be recognized efficiently the complexity of recognizing Gallai graphs is unknown. In the present paper we characterize those graphs whose Gallai graphs are forests or trees, respectively.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2013-12-11T08:28:10.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "line graph",
      "recognizing gallai graphs",
      "distinct vertices",
      "complexity"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 14,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1312.3072J"
    }
  }
}