scientific article; zbMATH DE number 4121434
From MaRDI portal
Complexity of computation (including implicit computational complexity) (03D15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
- A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number
- On NP-hardness of the clique partition -- independence number gap recognition and related problems
- On clique partitions of split graphs
- The complexity of generalized clique packing
- Edge clique partition in \((k,\ell)\)-graphs
Cited in
(15)- The complexity of generalized clique packing
- On clique partitions of split graphs
- A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number
- Weighted 2-sections and hypergraph reconstruction
- Edge clique partition in \((k,\ell)\)-graphs
- Clustering with partial information
- On NP-hardness of the clique partition -- independence number gap recognition and related problems
- Edge clique partition of \(K _{4}\)-free and planar graphs
- Clustering with Partial Information
- scientific article; zbMATH DE number 4116583 (Why is no real title available?)
- Constrained representations of map graphs and half-squares
- The complexity of partitioning into disjoint cliques and a triangle-free graph
- scientific article; zbMATH DE number 7764108 (Why is no real title available?)
- Graph factors and factorization: 1985--2003: a survey
- Partition into cliques for cubic graphs: Planar case, complexity and approximation
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 Q4734765)
