scientific article; zbMATH DE number 1088275

zbMATH Open0883.05118MaRDI QIDQ4364591FDOQ4364591

Takao Nishizeki, Xiao Zhou, Md. Abul Kashem

Publication date: 23 February 1998

Title of this publication is not available (Why is that?)

zbMATH Keywords

bounded treewidthvertex rankingpartial \(k\)-treeseparator tree

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (2)

• Algorithms for generalized vertex-rankings of partial k-trees
• Edge ranking of weighted trees

   Recommendations

• Algorithms for generalized vertex-rankings of partial k-trees 👍 👎
• Vertex rankings of chordal graphs and weighted trees 👍 👎
• The minimum semidefinite rank of the complement of partial \(k\)-trees 👍 👎
• Title not available (Why is that?) 👍 👎
• On vertex rankings of graphs and its relatives 👍 👎
• Generalized \(k\)-\(d\)-trees and local reorganizations 👍 👎
• Algorithms and Computation 👍 👎
• Title not available (Why is that?) 👍 👎
• On the number of vertices of each rank in phylogenetic trees and their generalizations 👍 👎
• Vertex partitioning problems on partial k-trees 👍 👎

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 Q4364591)