scientific article; zbMATH DE number 4008410

MaRDI QIDQ3758844zbMATH OpenFDO

Authors Stefan Arnborg, Andrzej Proskurowski

Publication date 1985

zbMATH Keywords

partial k-trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4094838
• Characterization and Recognition of Partial 3-Trees
• A characterization of partial 3-trees
• Characterization of partial 3-trees in terms of three structures
• scientific article; zbMATH DE number 3866594

Cited in

(13)

• Edge-maximal graphs of branchwidth k: The k-branches
• Characterization of partial 3-trees in terms of three structures
• The nonexistence of reduction rules giving an embedding into a \(k\)-tree
• Computing the branchwidth of interval graphs
• The d-precoloring problem for k-degenerate graphs
• Maximum matching width: new characterizations and a fast algorithm for dominating set
• scientific article; zbMATH DE number 3841909 (Why is no real title available?)
• NC Algorithms for Recognizing Partial 2-Trees and 3-Trees
• Characterization and Recognition of Partial 3-Trees
• scientific article; zbMATH DE number 4094838 (Why is no real title available?)
• scientific article; zbMATH DE number 637311 (Why is no real title available?)
• A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths
• Regular-factors in the complements of 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 Q3758844)