Pages that link to "Item:Q1201270"
From MaRDI portal
The following pages link to The max clique problem in classes of string-graphs (Q1201270):
Displaying 20 items.
- Intersection graphs of L-shapes and segments in the plane (Q277615) (← links)
- The clique problem in ray intersection graphs (Q377488) (← links)
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- On intersection representations of co-planar graphs (Q1377831) (← links)
- Maximum independent set and maximum clique algorithms for overlap graphs (Q1408815) (← links)
- On the maxima of Motzkin-Straus programs and cliques of graphs (Q2089888) (← links)
- On grounded \(\llcorner\)-graphs and their relatives (Q2315438) (← links)
- Segment representations with small resolution (Q2338214) (← links)
- The maximum clique problem in multiple interval graphs (Q2350898) (← links)
- Order-Preserving 1-String Representations of Planar Graphs (Q2971141) (← links)
- Maximum Independent Set in 2-Direction Outersegment Graphs (Q3104773) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- On approximating MIS over B1-VPG graphs* (Q5057743) (← links)
- (Q5115779) (← links)
- (Q5116474) (← links)
- Finding a Maximum Clique in a Grounded 1-Bend String Graph (Q5886042) (← links)
- Polychromatic colorings of unions of geometric hypergraphs (Q6039420) (← 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)
