The Graph Theory General Position Problem on Some Interconnection Networks
From MaRDI portal
Publication:3120181
DOI10.3233/FI-2018-1748zbMath1407.68367arXiv1710.00244WikidataQ128978870 ScholiaQ128978870MaRDI QIDQ3120181
Publication date: 1 March 2019
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.00244
interconnection networks; isometric subgraph; general position problem; Beneš networks; infinite grids; monotone-geodesic labeling
68R10: Graph theory (including graph drawing) in computer science
Related Items
Characterization of classes of graphs with large general position number, On the General Position Number of Complementary Prisms, THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES, General d-position sets, General position sets in two families of Cartesian product graphs, On the general position numbers of maximal outerplane graphs, The general position avoidance game and hardness of general position games, General position polynomials, On general position sets in Cartesian products, The general position problem on Kneser graphs and on some graph operations, The edge general position problem, On the mutual visibility in Cartesian products and triangle-free graphs, The general position achievement game played on graphs, The general position number of Cartesian products involving a factor with small diameter, A Steiner general position problem in graph theory, The general position problem and strong resolving graphs, Characterization of general position sets and its applications to cographs and bipartite graphs, The general position number of integer lattices, Mutual visibility in graphs
