scientific article; zbMATH DE number 5670538

MaRDI QIDQ3403689zbMATH OpenFDO

Authors

Publication date 12 February 2010

zbMATH Keywords

chaindissectioncomplete \(r\)-partite graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On dissection of graphs
• scientific article; zbMATH DE number 536589
• scientific article; zbMATH DE number 4039951
• On dissection of unicyclic graphs
• A new view toward vertex decomposable graphs
• Building graph separators with the recursive rotation algorithm for the nested dissection method
• A new construction for vertex decomposable graphs
• A new method for computing domination polynomials of graphs
• A new graph characteristic and its application to numerical computability
• scientific article; zbMATH DE number 11360

Cited in

(1)

• On dissection of graphs

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