scientific article; zbMATH DE number 1045605

DOI10.1002/(SICI)1097-0037(199705)29:3%3C135::AID-NET1%3E3.0.CO;2-IMaRDI QIDQ4347280zbMATH OpenFDO

Authors Yanpei Liu

Publication date 14 December 1997

Full work available at URL https://doi.org/10.1002/(SICI)1097-0037(199705)29:3%3C135::AID-NET1%3E3.0.CO;2-I

zbMATH Keywords

bandwidthcyclecyclic bandwidthdistanceembeddinglabelingpathtree

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Publication:4940077
• Bounding the bandwidths for graphs
• scientific article; zbMATH DE number 719423

Cited in

(13)

• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• Bounding the bandwidths for graphs
• Tabu search for the cyclic bandwidth problem
• The Cyclic Antibandwidth Problem
• Antibandwidth of Complete k-Ary Trees
• Embedding spanning subgraphs of small bandwidth
• scientific article; zbMATH DE number 719423 (Why is no real title available?)
• scientific article; zbMATH DE number 2016615 (Why is no real title available?)
• scientific article; zbMATH DE number 903251 (Why is no real title available?)
• scientific article; zbMATH DE number 1389222 (Why is no real title available?)
• scientific article; zbMATH DE number 1409236 (Why is no real title available?)
• Cyclic bandwidth sum of graphs
• A multi-start variable neighborhood tabu search algorithm for the cyclic bandwidth problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4347280)