Lower general position sets in graphs

DOI10.7151/DMGT.2542MaRDI QIDQ6985855zbMATH OpenFDO

Authors Gabriele Di Stefano, Sandi Klavžar, James Tuite, Ismael G. Yero

Publication date 12 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2542

zbMATH Keywords

computational complexitygeneral position numbergeodetic numberKneser graphsline graphsuniversal line

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76) Analysis of algorithms and problem complexity (68Q25)

Cites work

• A de Bruijn-Erdős theorem for \((q,q-4)\)-graphs
• A de Bruijn-Erdős theorem for chordal graphs
• A de Bruijn-Erdős theorem in graphs?
• A general position problem in graph theory
• A new class of graphs that satisfies the Chen-Chvátal conjecture
• A Steiner general position problem in graph theory
• Characterization of classes of graphs with large general position number
• Characterization of general position sets and its applications to cographs and bipartite graphs
• Computational and structural aspects of the geodetic and the hull numbers of shadow graphs
• Extreme Geodesic Graphs
• General d-position sets
• Geometric dominating sets -- a minimum version of the no-three-in-line problem
• Graphs with no induced house nor induced hole have the de Bruijn–Erdös property
• scientific article; zbMATH DE number 3484068 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Martin Gardner’s Minimum No-3-in-a-Line Problem
• Mutual visibility in graphs
• On a Problem of Heilbronn
• On monophonic position sets in graphs
• On some extremal position problems for graphs
• On the extremal combinatorics of the Hamming space
• On the General Position Number of Complementary Prisms
• On the general position number of two classes of graphs
• On the general position problem on Kneser graphs
• On the vertex position number of graphs
• Problems related to a de Bruijn-Erdös theorem
• Research Problems in Discrete Geometry
• Some advances in the no-three-in-line problem
• The edge general position problem
• The general position achievement game played on 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
• The general position problem and strong resolving graphs
• The general position problem on Kneser graphs and on some graph operations
• The No-Three-In-Line Problem
• Topics in graph theory. Graphs and their Cartesian product
• TRAVERSING A GRAPH IN GENERAL POSITION
• Universal lines in graphs

Cited in

(8)

• General position sets, colinear sets, and Sierpiński product graphs
• Lower general position in Cartesian products
• The iteration time and the general position number in graph convexities
• On some extremal position problems for graphs
• Edge general position in graphs: graph products, integer linear programming and some applications
• On the variety of general position problems under vertex and edge removal
• Three algorithmic approaches to the general position problem
• Builder-blocker general position games

This page was built for publication: Lower general position sets in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985855)