Visibility in hypercubes
From MaRDI portal
Cites work
- A survey of hypergraph Ramsey problems
- Asymptotic lower bounds for Ramsey functions
- Boolean lattices: Ramsey properties and embeddings
- Coloring the vertices of a graph with mutual-visibility property
- Daisies and other Turán problems
- Error detecting and error correcting codes
- Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- Lower (total) mutual-visibility number in graphs
- Lower bounds for constant weight codes
- Mutual visibility in graphs
- Mutual-visibility in strong products of graphs via total mutual-visibility
- Mutual-visibility problems in Kneser and Johnson graphs
- Mutual-visibility problems on graphs of diameter two
- Mutual-visibility sets in Cartesian products of paths and cycles
- On Group and Nongroup Perfect Codes in q Symbols.
- On linear and nonlinear single-error-correcting q-nary perfect codes
- On the mutual visibility in Cartesian products and triangle-free graphs
- Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products
- Total mutual-visibility in Hamming graphs
- Turán densities for daisies and hypercubes
- Turán numbers of r-graphs on r + 1 vertices
- Variety of mutual-visibility problems in graphs
- Variety of mutual-visibility problems in hypercubes
This page was built for publication: Visibility in hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230029)