The interval graph completion problem for the complete multipartite graphs

MaRDI QIDQ3405110zbMATH OpenFDO

Authors Yalin Hou, Zhenkun Zhang

Publication date 12 February 2010

zbMATH Keywords

profilepathwidththe complete multipartite graphthe interval graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• scientific article; zbMATH DE number 5671249
• On the interval completion of chordal graphs
• Characterizing Minimal Interval Completions
• Profile minimization on compositions of graphs
• Proper interval graph extention problems of the complements of trees

Cited in

(6)

• scientific article; zbMATH DE number 5671249 (Why is no real title available?)
• Minimal interval completion through graph exploration
• Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
• Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
• Profile minimization on products of graphs
• On the interval completion of chordal graphs

This page was built for publication: The interval graph completion problem for the complete multipartite graphs

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