On the mutual visibility in Cartesian products and triangle-free graphs
From MaRDI portal
Publication:2096353
Recommendations
Cites work
- A general position problem in graph theory
- A new upper bound on the number of edges in a geodetic graph
- Characterization of classes of graphs with large general position number
- Characterization of general position sets and its applications to cographs and bipartite graphs
- Computing the metric dimension of a graph from primary subgraphs
- Equitable total coloring of corona of cubic graphs
- Extremal combinatorics. With applications in computer science
- Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
- Geodetic blocks of diameter three
- Handbook of product graphs
- scientific article; zbMATH DE number 7203208 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- Mutual visibility by asynchronous robots on infinite grid
- Mutual visibility by luminous robots without collisions
- Mutual visibility in graphs
- Neighbor sum distinguishing total colorings of corona of subcubic graphs
- On a problem of K. Zarankiewicz
- On general position sets in Cartesian products
- On Graphs that do not Contain a Thomsen Graph
- On planar geodetic graphs
- On the corona of two graphs
- On the general position problem on Kneser graphs
- Optimum algorithm for the mutual visibility problem
- Supersaturation of C₄: from Zarankiewicz towards Erdős-Simonovits-Sidorenko
- The general position number of Cartesian products involving a factor with small diameter
- The general position number of integer lattices
- The general position number of the Cartesian product of two trees
- The general position problem on Kneser graphs and on some graph operations
- The graph theory general position problem on some interconnection networks
Cited in
(27)- Mutual visibility in graphs
- Variety of mutual-visibility problems in graphs
- Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products
- Geodesic packing in graphs
- Lower (total) mutual-visibility number in graphs
- Mutual-visibility sets in Cartesian products of paths and cycles
- On the mutual visibility in Cartesian products and triangle-free graphs
- Mutual-visibility problems on graphs of diameter two
- Mutual-visibility in strong products of graphs via total mutual-visibility
- The k-distance mutual-visibility problem in graphs
- Total mutual-visibility in Hamming graphs
- On the approximability of graph visibility problems
- Mobile mutual-visibility sets in graphs
- Moving through Cartesian products, coronas and joins in general position
- Coloring the vertices of a graph with mutual-visibility property
- Lower general position in Cartesian products
- Visibility polynomials, dual visibility spectrum, and characterization of total mutual-visibility sets
- 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
- Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products
- Mutual-visibility and general position in double graphs and in Mycielskians
- Mutual and total mutual visibility in hypercube-like graphs
- On the approximability of graph visibility problems
- Visibility in hypercubes
- Independent mutual-visibility coloring and related concepts
- The vertex visibility number of graphs
This page was built for publication: On the mutual visibility in Cartesian products and triangle-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096353)
