Antibandwidth of three-dimensional meshes
From MaRDI portal
Publication:960961
DOI10.1016/j.disc.2009.03.029zbMath1216.05136MaRDI QIDQ960961
Publication date: 29 March 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.029
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Level-based heuristics and hill climbing for the antibandwidth maximization problem, A note on maximum differential coloring of planar graphs, Bandwidth and pathwidth of three-dimensional grids, Antibandwidth and cyclic antibandwidth of Hamming graphs, Bandwidth of the product of paths of the same length, Antibandwidth and Cyclic Antibandwidth of Hamming Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compressions and isoperimetric inequalities
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- Hamiltonian powers in threshold and arborescent comparability graphs
- Matchings and paths in the cube
- On Some Variants of the Bandwidth Minimization Problem
- Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs
- On the separation number of a graph
- Optimal Indexing of the Vertices of Graphs