A CHARACTERIZATION OF k-TH POWERS Pn,k OF PATHS IN TERMS OF k-TREES

DOI10.1142/S0129054101000576zbMath1320.05098OpenAlexW2015567439MaRDI QIDQ5249270

Tetsuro Nishino, Koich Yamazaki, Sei'ichi Tani

Publication date: 30 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054101000576

zbMATH Keywords

bandwidthtreewidth\(k\)-trees\(k\)-th power of paths

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items (1)

A note on the subgraphs of the (\(2\times \infty \))-grid

Cites Work

• Characterizations and algorithmic applications of chordal graph embeddings
• On simple characterizations of k-trees
• The bandwidth problem for graphs and matrices—a survey
• Approximating the Bandwidth for Asteroidal Triple-Free Graphs
• Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques

This page was built for publication: A CHARACTERIZATION OF k-TH POWERS P_n,k OF PATHS IN TERMS OF k-TREES