The decomposability of minimum fill-in problems for graphs

MaRDI QIDQ5319393zbMATH OpenFDO

Authors Xiumei Wang, Yanpei Liu, Zhenkun Zhang

Publication date 22 July 2009

zbMATH Keywords

chordal graphdecomposition theoremfill-in numbergraph labeling

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• scientific article; zbMATH DE number 5059933
• scientific article; zbMATH DE number 1185971
• A local reductive elimination for the fill-in of graphs
• The General Minimum Fill-In Problem
• Minimum fill-in of sparse graphs: kernelization and approximation

Cited in

(9)

• Fill-in and operations of graphs
• A local reductive elimination for the fill-in of graphs
• Minimum \(H\)-decompositions of graphs
• Characterizing and Computing Minimal Cograph Completions
• The General Minimum Fill-In Problem
• scientific article; zbMATH DE number 1185971 (Why is no real title available?)
• scientific article; zbMATH DE number 2095795 (Why is no real title available?)
• Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
• scientific article; zbMATH DE number 5059933 (Why is no real title available?)

This page was built for publication: The decomposability of minimum fill-in problems for graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5319393)