{
  "id": "math/9807022",
  "version": "v1",
  "published": "1998-07-03T21:15:54.000Z",
  "updated": "1998-07-03T21:15:54.000Z",
  "title": "The leafage of a chordal graph",
  "authors": [
    "In-Jen Lin",
    "Terry A. McKee",
    "Douglas B. West"
  ],
  "comment": "19 pages, 3 figures",
  "journal": "Discussiones Mathematicae - Graph Theory 18(1998), 23-48",
  "categories": [
    "math.CO"
  ],
  "abstract": "The leafage l(G) of a chordal graph G is the minimum number of leaves of a tree in which G has an intersection representation by subtrees. We obtain upper and lower bounds on l(G) and compute it on special classes. The maximum of l(G) on n-vertex graphs is n - lg n - (1/2) lg lg n + O(1). The proper leafage l*(G) is the minimum number of leaves when no subtree may contain another; we obtain upper and lower bounds on l*(G). Leafage equals proper leafage on claw-free chordal graphs. We use asteroidal sets and structural properties of chordal graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "1998-07-03T21:15:54.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C75",
      "05C05",
      "05C35"
    ],
    "keywords": [
      "minimum number",
      "lower bounds",
      "leafage equals proper leafage",
      "claw-free chordal graphs",
      "n-vertex graphs"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 19,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "1998math......7022L"
    }
  }
}