Antibandwidth of Complete k-Ary Trees
From MaRDI portal
Recommendations
Cites work
- A dynamic survey of graph labeling
- Hamiltonian powers in threshold and arborescent comparability graphs
- scientific article; zbMATH DE number 1045605 (Why is no real title available?)
- scientific article; zbMATH DE number 2016615 (Why is no real title available?)
- On Some Variants of the Bandwidth Minimization Problem
- On the separation number of a graph
- Powers of Hamiltonian paths in interval graphs
Cited in
(11)- Antibandwidth of complete \(k\)-ary trees
- Bandwidth of the complete \(k\)-ary tree
- The maximum \(k\)-differential coloring problem
- Antibandwidth and cyclic antibandwidth of Hamming graphs
- Tabu search for the cyclic bandwidth problem
- The Cyclic Antibandwidth Problem
- Antibandwidth of Three-Dimensional Meshes
- A note on maximum differential coloring of planar graphs
- Some results on the antibandwidth of \(k\)-ary complete trees of height 3 for odd \(k\)
- Memetic algorithm for the antibandwidth maximization problem
- Separation numbers of trees
This page was built for publication: Antibandwidth of Complete k-Ary Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439448)