The general position number of integer lattices

DOI10.1016/j.amc.2020.125664zbMath1462.05124arXiv2003.12959OpenAlexW3092320636MaRDI QIDQ2660838

Gregor Rus, Sandi Klavžar

Publication date: 31 March 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.12959

zbMATH Keywords

Erdős-Szekeres theoreminteger latticeCartesian product of graphsgeneral position problem

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items (14)

The general position achievement game played on graphs ⋮ General position sets in two families of Cartesian product graphs ⋮ On the general position numbers of maximal outerplane graphs ⋮ Some position problems for graphs ⋮ The general position avoidance game and hardness of general position games ⋮ The general position number of Cartesian products involving a factor with small diameter ⋮ A Steiner general position problem in graph theory ⋮ On general position sets in Cartesian products ⋮ On the General Position Number of Complementary Prisms ⋮ THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES ⋮ On the general position number of two classes of graphs ⋮ The edge general position problem ⋮ On the mutual visibility in Cartesian products and triangle-free graphs ⋮ General d-position sets

Cites Work

• Unnamed Item
• Unnamed Item
• Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
• Gathering of oblivious robots on infinite grids with minimum traveled distance
• Linkage on the infinite grid
• Optimal \((t, r)\) broadcasts on the infinite grid
• On the extremal combinatorics of the Hamming space
• The general position problem and strong resolving graphs
• Characterization of general position sets and its applications to cographs and bipartite graphs
• Signed coloring of 2-dimensional grids
• Locating-total domination in grid graphs
• The Graph Theory General Position Problem on Some Interconnection Networks
• An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications
• A GENERAL POSITION PROBLEM IN GRAPH THEORY

This page was built for publication: The general position number of integer lattices