scientific article; zbMATH DE number 4121434

zbMath0684.68057MaRDI QIDQ4734765

Shaohan Ma, Walter D. Wallis, Julin Wu

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

chordal graphsNP-completeclique partition number\(K_ 4\)-free graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (8)

Weighted 2-sections and hypergraph reconstruction ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Unnamed Item ⋮ On clique partitions of split graphs ⋮ Edge clique partition in \((k,\ell)\)-graphs ⋮ Clustering with partial information ⋮ Clustering with Partial Information ⋮ Unnamed Item

This page was built for publication: