Bandwidth of theta graphs with short paths

DOI10.1016/0012-365X(92)90268-KzbMath0761.05084OpenAlexW2067371453MaRDI QIDQ1197053

Aditya Shastri, G. W. Peck

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90268-k

zbMATH Keywords

bandwidthvertex labelingtheta graphsshort paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (6)

Bandwidth of chain graphs ⋮ Hardness results for approximating the bandwidth ⋮ Approximating the bandwidth for asteroidal triple-free graphs ⋮ Unnamed Item ⋮ Bandwidth and topological bandwidth of graphs with few \(P_4\)'s ⋮ The extremal function for two disjoint cycles

Cites Work

• Unnamed Item
• Finding the minimum bandwidth of an interval graph
• On the coverings of graphs
• The NP-completeness of the bandwidth minimization problem
• The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
• Computing the Bandwidth of Interval Graphs
• The bandwidth problem for graphs and matrices—a survey
• The Bandwidth of Caterpillars with Hairs of Length 1 and 2
• Complexity Results for Bandwidth Minimization

This page was built for publication: Bandwidth of theta graphs with short paths