Pages that link to "Item:Q412277"
From MaRDI portal
The following pages link to Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277):
Displaying 20 items.
- Coloring intersection graphs of arc-connected sets in the plane (Q464743) (← links)
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
- Coloring non-crossing strings (Q727171) (← links)
- New bounds on the maximum number of edges in \(k\)-quasi-planar graphs (Q904085) (← links)
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- On dominating set of some subclasses of string graphs (Q2144448) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- On the speed of algebraically defined graph classes (Q2227284) (← links)
- Triangle-free geometric intersection graphs with no large independent sets (Q2256591) (← links)
- Coloring curves that cross a fixed curve (Q2415382) (← links)
- On the Size of Planarly Connected Crossing Graphs (Q2961524) (← links)
- Quasi-planar Graphs (Q5001655) (← links)
- On approximating MIS over B1-VPG graphs* (Q5057743) (← links)
- (Q5088968) (← links)
- Two-Planar Graphs Are Quasiplanar (Q5111262) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Applications of a New Separator Theorem for String Graphs (Q5414146) (← links)
- Disjoint edges in complete topological graphs (Q5917904) (← links)
- Many disjoint edges in topological graphs (Q5919826) (← links)
