Graph partition into small cliques

DOI10.1016/j.dam.2013.09.003zbMath1300.05263OpenAlexW2010003024MaRDI QIDQ741755

Beibei Zhang, Jin Yan, Yun Shu Gao

Publication date: 12 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.09.003

zbMATH Keywords

cliquedegree conditionvertex-disjoint

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (3)

The confirmation of a conjecture on disjoint cycles in a graph ⋮ A note on abelian partitionable groups ⋮ Disjoint cliques in claw-free graphs

Cites Work

• Unnamed Item
• Clique partitions and clique coverings
• On the maximal number of independent triangles in graphs
• Disjoint cliques and disjoint maximal independent sets of vertices in graphs
• On the maximum number of independent cycles in a graph
• Clique coverings and partitions of line graphs
• How many graphs are unions of k‐cliques?
• On the maximal number of independent circuits in a graph
• Disjoint triangles and quadrilaterals in a graph

This page was built for publication: Graph partition into small cliques