Pages that link to "Item:Q1918550"
From MaRDI portal
The following pages link to On bounding the chromatic number of L-graphs (Q1918550):
Displaying 13 items.
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes (Q463287) (← links)
- Coloring intersection graphs of arc-connected sets in the plane (Q464743) (← links)
- Coloring intersection graphs of \(x\)-monotone curves in the plane (Q485004) (← links)
- New bounds on the maximum number of edges in \(k\)-quasi-planar graphs (Q904085) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- On dominating set of some subclasses of string graphs (Q2144448) (← links)
- On grounded \(\llcorner\)-graphs and their relatives (Q2315438) (← links)
- Coloring curves that cross a fixed curve (Q2415382) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)
- Finding geometric representations of apex graphs is \textsf{NP}-hard (Q6175518) (← links)
- Coloring triangle-free L-graphs with \(O (\log \log n)\) colors (Q6181998) (← links)
- Recognizing geometric intersection graphs stabbed by a line (Q6204544) (← links)
