scientific article; zbMATH DE number 426342

zbMATH Open0785.05054MaRDI QIDQ3137191FDOQ3137191

Authors: Ervin Győri 

Publication date: 1 November 1993

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

Recommendations

• scientific article; zbMATH DE number 4039954
• On the number of edge disjoint cliques in graphs of given size
• Graph partition into small cliques
• scientific article; zbMATH DE number 1101882
• scientific article; zbMATH DE number 6093217

zbMATH Keywords

decompositionedge disjoint cliques

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 (10)

• Title not available (Why is that?)
• Sharp bounds for decomposing graphs into edges and triangles
• Title not available (Why is that?)
• Edge-Disjoint Cliques in Graphs with High Minimum Degree
• Edge-clique graphs
• Disjoint cliques and disjoint maximal independent sets of vertices in graphs
• Disjoint cliques in claw-free graphs
• Disjoint edges in geometric graphs
• Disjoint edges in geometric graphs
• The disjoint cliques problem

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