A CHARACTERIZATION OF k-TH POWERS P<sub>n,k</sub> OF PATHS IN TERMS OF k-TREES (Q5249270): Difference between revisions

@@ Property / author @@
-Sei'ichi Tani
@@ Property / author: Sei'ichi Tani / rank @@
-Normal rank
@@ Property / author @@
+Sei'ichi Tani
@@ Property / author: Sei'ichi Tani / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The bandwidth problem for graphs and matrices—a survey
+Normal rank
@@ Property / cites work @@
+Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
+Normal rank
@@ Property / cites work @@
+Approximating the Bandwidth for Asteroidal Triple-Free Graphs
+Normal rank
@@ Property / cites work @@
+Characterizations and algorithmic applications of chordal graph embeddings
+Normal rank
@@ Property / cites work @@
+On simple characterizations of k-trees
@@ Property / cites work: On simple characterizations of k-trees / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0129054101000576
+Normal rank
@@ Property / OpenAlex ID @@
+W2015567439
@@ Property / OpenAlex ID: W2015567439 / rank @@
+Normal rank