On the chromatic number of multiple interval graphs and overlap graphs
From MaRDI portal
Publication:1061131
DOI10.1016/0012-365X(85)90044-5zbMath0569.05019WikidataQ56503305 ScholiaQ56503305MaRDI QIDQ1061131
Publication date: 1985
Published in: Discrete Mathematics (Search for Journal in Brave)
chromatic number; clique number; circular-arc graphs; NP-complete problem; overlap graphs; multiple interval graphs
05C15: Coloring of graphs and hypergraphs
Related Items
A Turán-type theorem on chords of a convex polygon, Covering and coloring polygon-circle graphs, Quasi-planar graphs have a linear number of edges, A triangle-free circle graph with chromatic number 5, On bounding the chromatic number of L-graphs