Publication:3832590
From MaRDI portal
zbMath0677.05027MaRDI QIDQ3832590
Publication date: 1988
05C15: Coloring of graphs and hypergraphs
Related Items
Ramsey-type constructions for arrangements of segments, On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes, Bounds for chromatic number in terms of even-girth and booksize, Ramsey-type constructions for arrangements of segments, Independent sets and chromatic numbers of circle graphs, Finding common structured patterns in linear graphs, Every circle graph of girth at least 5 is 3-colourable, 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 a set of touching strings