Pages that link to "Item:Q5408587"
From MaRDI portal
The following pages link to On the General Position Subset Selection Problem (Q5408587):
Displayed 22 items.
- Additive combinatorics and graph theory (Q1620873) (← links)
- On general position sets in Cartesian products (Q2041227) (← links)
- The general position problem on Kneser graphs and on some graph operations (Q2042634) (← links)
- A new lower bound on Hadwiger-Debrunner numbers in the plane (Q2055287) (← 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)
- The general position number of Cartesian products involving a factor with small diameter (Q2242842) (← links)
- Characterization of general position sets and its applications to cographs and bipartite graphs (Q2279405) (← links)
- General position subsets and independent hyperplanes in \(d\)-space (Q2397235) (← links)
- On Subgraphs of Bounded Degeneracy in Hypergraphs (Q3181066) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Finding Points in General Position (Q4605338) (← 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 Number of Complementary Prisms (Q4989178) (← links)
- On independent position sets in graphs (Q5027724) (← links)
- Convex polygons in Cartesian products (Q5088949) (← links)
- (Q5111239) (← links)
- General position sets in two families of Cartesian product graphs (Q6040049) (← links)
- The extensible no-three-in-line problem (Q6056561) (← links)
- The general position avoidance game and hardness of general position games (Q6150675) (← links)