scientific article
From MaRDI portal
Publication:3832590
zbMath0677.05027MaRDI QIDQ3832590
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (22)
Improved bounds for colouring circle graphs ⋮ Covering and coloring polygon-circle graphs ⋮ The total chromatic number of any multigraph with maximum degree five is at most seven ⋮ A triangle-free circle graph with chromatic number 5 ⋮ Coloring curves that cross a fixed curve ⋮ Bounds for chromatic number in terms of even-girth and booksize ⋮ Quasiplanar graphs, string graphs, and the Erdős-Gallai problem ⋮ Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded ⋮ Independent sets and chromatic numbers of circle graphs ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes ⋮ Ramsey-type constructions for arrangements of segments ⋮ Ramsey-type constructions for arrangements of segments ⋮ Finding common structured patterns in linear graphs ⋮ Conflict-free coloring of string graphs ⋮ Unnamed Item ⋮ Coloring non-crossing strings ⋮ On the chromatic number of disjointness graphs of curves ⋮ Outerstring Graphs are $\chi$-Bounded ⋮ Every circle graph of girth at least 5 is 3-colourable ⋮ Coloring a set of touching strings ⋮ Circle graphs are quadratically χ‐bounded
This page was built for publication:
