Characterization of classes of graphs with large general position number
From MaRDI portal
Publication:4956197
DOI10.1016/j.akcej.2019.08.008zbMath1468.05066arXiv2004.04648OpenAlexW3048277183MaRDI QIDQ4956197
Elias John Thomas, Ullas Chandran S. V.
Publication date: 1 September 2021
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.04648
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (9)
The general position achievement game played on graphs ⋮ Mutual visibility in graphs ⋮ The general position avoidance game and hardness of general position games ⋮ A Steiner general position problem in graph theory ⋮ On general position sets in Cartesian products ⋮ 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 ⋮ On independent position sets in graphs
Cites Work
This page was built for publication: Characterization of classes of graphs with large general position number