Pages that link to "Item:Q377499"
From MaRDI portal
The following pages link to Triangle-free geometric intersection graphs with large chromatic number (Q377499):
Displaying 18 items.
- Restricted frame graphs and a conjecture of Scott (Q252837) (← links)
- Intersection graphs of L-shapes and segments in the plane (Q277615) (← links)
- Triangle-free intersection graphs of line segments with large chromatic number (Q401487) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- Coloring intersection graphs of arc-connected sets in the plane (Q464743) (← links)
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
- Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors (Q2256590) (← links)
- Triangle-free geometric intersection graphs with no large independent sets (Q2256591) (← links)
- Coloring curves that cross a fixed curve (Q2415382) (← links)
- Secure multi-party convex hull protocol based on quantum homomorphic encryption (Q2686164) (← links)
- Burling graphs revisited. I: New characterizations (Q2700996) (← links)
- Box and Segment Intersection Graphs with Large Girth and Chromatic Number (Q5162871) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Decomposition of Multiple Packings with Subquadratic Union Complexity (Q5364271) (← links)
- Triangle‐free graphs with large chromatic number and no induced wheel (Q6047638) (← links)
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)
- Coloring triangle-free L-graphs with \(O (\log \log n)\) colors (Q6181998) (← links)
- Coloring triangle-free L-graphs with \(O(\log\log n)\) colors (Q6621266) (← links)
