A special antidilation problem for meshes and Hamming graphs
From MaRDI portal
Publication:432721
DOI10.1016/j.disc.2011.10.027zbMath1244.05153OpenAlexW2030435882MaRDI QIDQ432721
Publication date: 4 July 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.10.027
Orthogonal arrays, Latin squares, Room squares (05B15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Separation numbers of trees
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- On explicit formulas for bandwidth and antibandwidth of hypercubes
- Antibandwidth of complete \(k\)-ary trees
- Unsolved problems in geometry
- Eigenvalues and separation in graphs
- Hamiltonian powers in threshold and arborescent comparability graphs
- Well-Spaced Labelings of Points in Rectangular Grids
- Antibandwidth and Cyclic Antibandwidth of Hamming Graphs
- Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
- On Some Variants of the Bandwidth Minimization Problem
- Antibandwidth of d-Dimensional Meshes
- On the separation number of a graph
- Powers of Hamiltonian paths in interval graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A special antidilation problem for meshes and Hamming graphs