On the approximability of graph visibility problems
From MaRDI portal
Cites work
- A general position problem in graph theory
- Characterization of general position sets and its applications to cographs and bipartite graphs
- Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
- Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- Improved lower bounds on k‐independence
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Lower (total) mutual-visibility number in graphs
- Mutual and total mutual visibility in hypercube-like graphs
- Mutual visibility by luminous robots without collisions
- Mutual visibility in graphs
- Mutual-visibility in distance-hereditary graphs: a linear-time algorithm
- Mutual-visibility in strong products of graphs via total mutual-visibility
- Mutual-visibility problems on graphs of diameter two
- Mutual-visibility sets in Cartesian products of paths and cycles
- On general position sets in Cartesian products
- On the approximability of graph visibility problems
- On the mutual visibility in Cartesian products and triangle-free graphs
- Optimum algorithm for the mutual visibility problem
- Paired approximation problems and incompatible inapproximabilities
- Some remarks on the theory of graphs
- The general position number of Cartesian products involving a factor with small diameter
- The graph theory general position problem on some interconnection networks
- Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products
- Total mutual-visibility in Hamming graphs
- Variety of mutual-visibility problems in graphs
This page was built for publication: On the approximability of graph visibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851440)
