Pages that link to "Item:Q947779"

The following pages link to Separator theorems and Turán-type results for planar intersection graphs (Q947779):

Displaying 20 items.

• On the Zarankiewicz problem for intersection hypergraphs (Q272311) (← links)
• Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
• Zarankiewicz's problem for semi-algebraic hypergraphs (Q721064) (← links)
• A crossing lemma for Jordan curves (Q1647400) (← links)
• Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
• Extremal even-cycle-free subgraphs of the complete transposition graphs (Q2243230) (← links)
• A Separator Theorem for String Graphs and its Applications (Q3058296) (← links)
• A Separator Theorem for String Graphs and Its Applications (Q3605480) (← links)
• Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
• (Q5116474) (← links)
• Zarankiewicz’s problem for semilinear hypergraphs (Q5154785) (← links)
• Box and Segment Intersection Graphs with Large Girth and Chromatic Number (Q5162871) (← links)
• Applications of a New Separator Theorem for String Graphs (Q5414146) (← links)
• Near-Optimal Separators in String Graphs (Q5414151) (← links)
• Turán-type results for intersection graphs of boxes (Q5886122) (← links)
• Reachability problems for transmission graphs (Q5896888) (← links)
• Reachability problems for transmission graphs (Q5918537) (← links)
• Balanced line separators of unit disk graphs (Q5918796) (← links)
• Space-efficient algorithms for reachability in directed geometric graphs (Q6039899) (← links)
• String graphs have the Erdős-Hajnal property (Q6192228) (← links)