A general position problem in graph theory

DOI10.1017/S0004972718000473MaRDI QIDQ4684254zbMATH OpenOpenAlexFDO

Authors Paul Manuel, Sandi Klavžar

Publication date 27 September 2018

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

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

zbMATH Keywords

computational complexitygeneral position problemindependence numberisometric subgraphpacking

Mathematics Subject Classification ID

Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Characterization of classes of graphs with large general position number
• The graph theory general position problem on some interconnection networks
• General position sets in two families of Cartesian product graphs
• General d-position sets
• The edge general position problem

Cites work

• A note on the no-three-in-line problem on a torus
• Average distance and generalised packing in graphs
• Distance-regular isometric subgraphs of the halved cubes
• Finding points in general position
• Hamiltonian laceability of hypercubes without isometric subgraphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1409232 (Why is no real title available?)
• scientific article; zbMATH DE number 1439423 (Why is no real title available?)
• Isometric path numbers of graphs
• Isometric-path numbers of block graphs
• No-three-in-line-in-3D
• On isometric subgraphs of infinite bridged graphs and geodesic convexity
• On the General Position Subset Selection Problem
• Packing chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph
• Relations between packing and covering numbers of a tree
• Subdivided graphs as isometric subgraphs of Hamming graphs
• The S-packing chromatic number of a graph
• The packing chromatic number of the infinite square lattice is between 13 and 15

Cited in

(65)

• On general position sets in Cartesian products
• The general position problem on Kneser graphs and on some graph operations
• 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
• 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
• The graph theory general position problem on some interconnection networks
• Characterization of classes of graphs with large general position number
• 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
• General d-position sets
• On independent position sets in graphs
• General position sets in two families of Cartesian product graphs
• TRAVERSING A GRAPH IN GENERAL POSITION
• Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products
• On the general position numbers of maximal outerplane graphs
• Some position problems for graphs
• Edge general position sets in Fibonacci and Lucas cubes
• Extremal edge general position sets in some graphs
• The general position avoidance game and hardness of general position games
• General position polynomials
• On the general position number of Mycielskian graphs
• On monophonic position sets in graphs
• All-path convexity: two characterizations, general position number, and one algorithm
• PSO based constraint optimization of intuitionistic fuzzy shortest path problem in an undirected network
• Mutual-visibility problems on graphs of diameter two
• Mutual-visibility in strong products of graphs via total mutual-visibility
• Variety of general position problems in graphs
• On the general position number of the k -th power graphs
• On the approximability of graph visibility problems
• A note on the edge general position number of cactus graphs
• General position problems in strong and lexicographic products of graphs
• Mobile mutual-visibility sets in graphs
• General position sets, colinear sets, and Sierpiński product graphs
• Moving through Cartesian products, coronas and joins in general position
• Coloring the vertices of a graph with mutual-visibility property
• Counting largest mutual-visibility and general position sets of glued t-ary trees
• Lower general position in Cartesian products
• Visibility polynomials, dual visibility spectrum, and characterization of total mutual-visibility sets
• The general position number under vertex and edge removal
• Characterizing and computing in linear time mutual-visibility parameters in distance-hereditary graphs
• Mutual-visibility problems in Kneser and Johnson graphs
• Mutual d-visibility in graphs
• The edge general position number of some graphs
• Mutual-visibility and general position sets in Sierpiński triangle graphs
• Graphs whose edge general position number is 4
• Lower general position sets in graphs
• Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products
• On the vertex position number of graphs
• The iteration time and the general position number in graph convexities
• Mutual-visibility and general position in double graphs and in Mycielskians
• On the approximability of graph visibility problems
• On some extremal position problems for graphs
• Generalization of edge general position problem
• The k-general d-position problem 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

This page was built for publication: A general position problem in graph theory

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