On bounding the chromatic number of L-graphs

DOI10.1016/0012-365X(95)00316-OzbMath0856.05033MaRDI QIDQ1918550

Sean McGuinness

Publication date: 22 August 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

intersection graphinfinite graphchromatic numberboundclique numbercliqueL-shape

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (13)

On dominating set of some subclasses of string graphs ⋮ Coloring curves that cross a fixed curve ⋮ Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded ⋮ Finding geometric representations of apex graphs is \textsf{NP}-hard ⋮ Coloring triangle-free L-graphs with \(O (\log \log n)\) colors ⋮ New bounds on the maximum number of edges in \(k\)-quasi-planar graphs ⋮ Recognizing geometric intersection graphs stabbed by a line ⋮ On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes ⋮ Coloring intersection graphs of arc-connected sets in the plane ⋮ Coloring intersection graphs of \(x\)-monotone curves in the plane ⋮ Conflict-free coloring of string graphs ⋮ On grounded \(\llcorner\)-graphs and their relatives ⋮ Outerstring Graphs are $\chi$-Bounded

Cites Work

• Unnamed Item
• On the chromatic number of multiple interval graphs and overlap graphs
• Covering and coloring problems for relatives of intervals
• On a Coloring Problem.
• A Note on the Equation n²+n+1=p^r

This page was built for publication: On bounding the chromatic number of L-graphs