Three algorithmic approaches to the general position problem

DOI10.1017/S0004972725100178MaRDI QIDQ7262473zbMATH OpenFDO

Authors Zahra Hamed-Labbafian, Narjes Sabeghi, M. Tavakoli, Sandi Klavžar

Publication date 11 June 2026

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0004972725100178

zbMATH Keywords

genetic algorithminteger linear programmingsimulated annealing algorithmgeneral position setgeneral position number

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• A Steiner general position problem in graph theory
• A general position problem in graph theory
• General position polynomials
• General position sets in two families of Cartesian product graphs
• Lower general position sets in graphs
• Mutual visibility in graphs
• 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 Mycielskian graphs
• On the general position number of the k -th power graphs
• On the vertex position number of graphs
• TRAVERSING A GRAPH IN GENERAL POSITION
• The edge general position problem
• The iteration time and the general position number in graph convexities
• Variety of general position problems in graphs

This page was built for publication: Three algorithmic approaches to the general position problem

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