Bandwidth of graphs resulting from the edge clique covering problem

zbMath1409.05174arXiv1605.00450MaRDI QIDQ668017

Konrad Engel, Sebastian Hanisch

Publication date: 5 March 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.00450

zbMATH Keywords

\(k\)-element subsetsbandwidth numberingbandwidth of graphsedge clique coveringsvertex clique coverings

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hardness results for approximating the bandwidth
• On the bandwidth of 3-dimensional Hamming graphs
• Optimal labelling of a product of two paths
• The NP-completeness of the bandwidth minimization problem
• On an isoperimetric problem for Hamming graphs
• On the bandwidth of a Hamming graph
• Reconstruction of cell-electrode-adjacencies on multielectrode arrays
• Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs
• The bandwidth problem for graphs and matrices—a survey
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• Index assignment for multichannel communication under failure
• Clique Cover on Sparse Networks
• Optimal numberings and isoperimetric problems on graphs
• A remark on a problem of Harary

This page was built for publication: Bandwidth of graphs resulting from the edge clique covering problem