A GENERAL POSITION PROBLEM IN GRAPH THEORY

DOI10.1017/S0004972718000473zbMath1396.05033OpenAlexW2883126758MaRDI QIDQ4684254

Sandi Klavžar, Paul D. Manuel

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 complexityindependence numberpackingisometric subgraphgeneral position problem

Mathematics Subject Classification ID

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

Related Items (27)

The general position achievement game played on graphs ⋮ The general position number of integer lattices ⋮ Mutual visibility 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 ⋮ 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 ⋮ Characterization of classes of graphs with large general position number ⋮ On general position sets in Cartesian products ⋮ The general position problem on Kneser graphs and on some graph operations ⋮ 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 ⋮ 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 ⋮ General d-position sets ⋮ On independent position sets in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the no-three-in-line problem on a torus
• Hamiltonian laceability of hypercubes without isometric subgraphs
• Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph
• The packing chromatic number of the infinite square lattice is between 13 and 15
• Average distance and generalised packing in graphs
• Isometric-path numbers of block graphs
• No-three-in-line-in-3D
• Subdivided graphs as isometric subgraphs of Hamming graphs
• Relations between packing and covering numbers of a tree
• On isometric subgraphs of infinite bridged graphs and geodesic convexity
• Distance-regular isometric subgraphs of the halved cubes
• Isometric path numbers of graphs
• The S-packing chromatic number of a graph
• Finding Points in General Position
• On the General Position Subset Selection Problem

This page was built for publication: A GENERAL POSITION PROBLEM IN GRAPH THEORY