General d-position sets
DOI10.26493/1855-3974.2384.77dzbMath1479.05082arXiv2005.08095OpenAlexW3139287643MaRDI QIDQ5013341
Sandi Klavžar, Douglas F. Rall, Ismael González Yero
Publication date: 30 November 2021
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.08095
computational complexityinfinite graphsdissociation setsgeneral \(d\)-position setsstrong resolving graphs
Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Infinite graphs (05C63)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- The strong metric dimension of graphs and digraphs
- Strong resolving graphs: the realization and the characterization problems
- On the extremal combinatorics of the Hamming space
- On general position sets in Cartesian products
- The general position problem on Kneser graphs and on some graph operations
- The general position problem and strong resolving graphs
- Characterization of general position sets and its applications to cographs and bipartite graphs
- On the vertex \(k\)-path cover
- The general position number of integer lattices
- The Graph Theory General Position Problem on Some Interconnection Networks
- Node-Deletion Problems on Bipartite Graphs
- The complexity of restricted spanning tree problems
- Uniformly dissociated graphs
- A GENERAL POSITION PROBLEM IN GRAPH THEORY
- On the general position problem on Kneser graphs
- On the General Position Number of Complementary Prisms
- THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES
- An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth
- Partially Ordered Sets
This page was built for publication: General d-position sets
