Pages that link to "Item:Q4605338"
From MaRDI portal
The following pages link to Finding Points in General Position (Q4605338):
Displayed 14 items.
- Computational complexity aspects of point visibility graphs (Q1720342) (← links)
- On the complexity of finding and counting solution-free sets of integers (Q1752464) (← links)
- The general position problem on Kneser graphs and on some graph operations (Q2042634) (← links)
- On the general position number of two classes of graphs (Q2084225) (← links)
- The edge general position problem (Q2091137) (← links)
- The general position achievement game played on graphs (Q2142694) (← links)
- Characterization of general position sets and its applications to cographs and bipartite graphs (Q2279405) (← links)
- A GENERAL POSITION PROBLEM IN GRAPH THEORY (Q4684254) (← links)
- Characterization of classes of graphs with large general position number (Q4956197) (← links)
- On the general position problem on Kneser graphs (Q4988852) (← links)
- On the General Position Number of Complementary Prisms (Q4989178) (← links)
- On independent position sets in graphs (Q5027724) (← links)
- Clique-width of point configurations (Q5918571) (← links)
- The general position avoidance game and hardness of general position games (Q6150675) (← links)