scientific article; zbMATH DE number 4031746

zbMATH Open0634.05056MaRDI QIDQ3772258FDOQ3772258

Authors: Dieter Kratsch 

Publication date: 1987

Title of this publication is not available (Why is that?)

Recommendations

• On the partition and coloring of a graph by cliques
• On partition graphs
• scientific article; zbMATH DE number 3872703
• Complete partitions of graphs
• Chromatic partitions of a graph

zbMATH Keywords

perfect graphk-partitionable graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (7)

• On the partition and coloring of a graph by cliques
• On a \(k\)-clique-join of a class of partitionalble graphs
• Partitioning permutations into increasing and decreasing subsequences
• Graph partition into small cliques
• On NP-hardness of the clique partition -- independence number gap recognition and related problems
• Title not available (Why is that?)
• Partitions of graphs into one or two independent sets and cliques

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 Q3772258)