On the chromatic number of multiple interval graphs and overlap graphs

Research output: Contribution to journalArticle

42 Citations (Scopus)

Abstract

Let χ(G) and ω(G) denote the chromatic number and clique number of a graph G. We prove that χ can be bounded by a function of ω for two well-known relatives of interval graphs. Multiple interval graphs (the intersection graphs of sets which can be written as the union of t closed intervals of a line) satisfy χ≤2t(ω-1) for ω≥2. Overlap graphs satisfy χ≤2ωω2(ω-1).

Original languageEnglish
Pages (from-to)161-166
Number of pages6
JournalDiscrete Mathematics
Volume55
Issue number2
DOIs
Publication statusPublished - 1985

Fingerprint

Interval Graphs
Chromatic number
Overlap
Clique number
Closed interval
Intersection Graphs
Graph in graph theory
Union
Denote
Line

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

On the chromatic number of multiple interval graphs and overlap graphs. / Gyárfás, A.

In: Discrete Mathematics, Vol. 55, No. 2, 1985, p. 161-166.

Research output: Contribution to journalArticle

@article{151193ee1807431fb325452ce1a55166,
title = "On the chromatic number of multiple interval graphs and overlap graphs",
abstract = "Let χ(G) and ω(G) denote the chromatic number and clique number of a graph G. We prove that χ can be bounded by a function of ω for two well-known relatives of interval graphs. Multiple interval graphs (the intersection graphs of sets which can be written as the union of t closed intervals of a line) satisfy χ≤2t(ω-1) for ω≥2. Overlap graphs satisfy χ≤2ωω2(ω-1).",
author = "A. Gy{\'a}rf{\'a}s",
year = "1985",
doi = "10.1016/0012-365X(85)90044-5",
language = "English",
volume = "55",
pages = "161--166",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - On the chromatic number of multiple interval graphs and overlap graphs

AU - Gyárfás, A.

PY - 1985

Y1 - 1985

N2 - Let χ(G) and ω(G) denote the chromatic number and clique number of a graph G. We prove that χ can be bounded by a function of ω for two well-known relatives of interval graphs. Multiple interval graphs (the intersection graphs of sets which can be written as the union of t closed intervals of a line) satisfy χ≤2t(ω-1) for ω≥2. Overlap graphs satisfy χ≤2ωω2(ω-1).

AB - Let χ(G) and ω(G) denote the chromatic number and clique number of a graph G. We prove that χ can be bounded by a function of ω for two well-known relatives of interval graphs. Multiple interval graphs (the intersection graphs of sets which can be written as the union of t closed intervals of a line) satisfy χ≤2t(ω-1) for ω≥2. Overlap graphs satisfy χ≤2ωω2(ω-1).

UR - http://www.scopus.com/inward/record.url?scp=0010757331&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0010757331&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(85)90044-5

DO - 10.1016/0012-365X(85)90044-5

M3 - Article

AN - SCOPUS:0010757331

VL - 55

SP - 161

EP - 166

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 2

ER -