scientific article; zbMATH DE number 4008410

zbMATH Open0622.05017MaRDI QIDQ3758844FDOQ3758844

Authors: Stefan Arnborg, Andrzej Proskurowski 

Publication date: 1985

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

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

zbMATH Keywords

partial k-trees

Mathematics Subject Classification ID

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

Cited In (11)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing the branchwidth of interval graphs
• Maximum matching width: new characterizations and a fast algorithm for dominating set
• Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches
• Regular-factors in the complements of partial k-trees
• The \(d\)-precoloring problem for \(k\)-degenerate graphs
• The nonexistence of reduction rules giving an embedding into a \(k\)-tree
• Characterization of partial 3-trees in terms of three structures
• A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths
• Characterization and Recognition of Partial 3-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)