Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
- Complete partitions of graphs
- Partition of a graph with its complete sub-graphs
- Partitions of Graphs
- Distinguishing partitions of complete multipartite graphs
- scientific article; zbMATH DE number 3889586
- Partitioning graphs into complete and empty graphs
- Covering the complete graph by partitions
- scientific article; zbMATH DE number 3867385
- On partition graphs
- scientific article; zbMATH DE number 3970800
Cites work
- scientific article; zbMATH DE number 3865318 (Why is no real title available?)
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- scientific article; zbMATH DE number 475586 (Why is no real title available?)
- scientific article; zbMATH DE number 1057876 (Why is no real title available?)
- scientific article; zbMATH DE number 1088659 (Why is no real title available?)
- scientific article; zbMATH DE number 1874447 (Why is no real title available?)
- scientific article; zbMATH DE number 3334007 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- A Parallel Repetition Theorem
- A threshold of ln n for approximating set cover
- Achromatic number is NP-complete for cographs and interval graphs
- Achromatic number versus pseudoachromatic number: A counterexample to a conjecture of Hedetniemi
- Achromatic numbers of random graphs
- Approximating the achromatic number problem on bipartite graphs
- Approximating the minimum maximal independence number
- Approximating theDomatic Number
- Asymmetric \(k\)-center is \(\log{^*}{n}\)-hard to approximate
- Balls and bins: A study in negative dependence
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Complete partitions of graphs
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Hadwiger's conjecture is true for almost every graph
- On approximating the achromatic number
- On the hardness of approximating minimization problems
- On the hardness of approximating spanners
- On the pseudoachromatic number of a graph
- On the pseudoachromatic number of join of graphs
- Partition graphs and coloring numbers of a graph
- Polylogarithmic inapproximability
- Proof verification and the hardness of approximation problems
- Some optimal inapproximability results
- The achromatic number of bounded degree trees
- The complexity of harmonious colouring for trees
Cited in
(19)- Complete partitions of graphs
- Complete multipartite graphs and Braess edges
- Partition of a graph with its complete sub-graphs
- scientific article; zbMATH DE number 4103104 (Why is no real title available?)
- Complete subgraphs in multipartite graphs
- Approximability of packing disjoint cycles
- Partitioning complete graphs by heterochromatic trees
- scientific article; zbMATH DE number 5077172 (Why is no real title available?)
- scientific article; zbMATH DE number 7316311 (Why is no real title available?)
- Canonical Vertex Partitions
- scientific article; zbMATH DE number 4008444 (Why is no real title available?)
- scientific article; zbMATH DE number 4033798 (Why is no real title available?)
- On co-complete \(k\)-partite graph valued functions
- Partitioning graphs into complete and empty graphs
- The saturation function of complete partite graphs
- Approximability of Packing Disjoint Cycles
- scientific article; zbMATH DE number 3889586 (Why is no real title available?)
- scientific article; zbMATH DE number 4031746 (Why is no real title available?)
- scientific article; zbMATH DE number 4051671 (Why is no real title available?)
This page was built for publication: Complete partitions of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q949754)
