Disjoint cliques in claw-free graphs

DOI10.1007/s10255-018-0737-yzbMath1383.05213OpenAlexW2790036905WikidataQ130185445 ScholiaQ130185445MaRDI QIDQ1709414

Su-yun Jiang, Jin Yan

Publication date: 5 April 2018

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-018-0737-y

zbMATH Keywords

claw-free graphsdegree conditiondisjoint clique

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) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Disjoint cycles with partial degree conditions in claw-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a sharp degree sum condition for disjoint chorded cycles in graphs
• Graph partition into small cliques
• Disjoint chorded cycles in graphs
• On the maximum number of independent cycles in a graph
• On the existence of disjoint cycles in a graph
• Claw-free graphs---a survey
• Triangles in claw-free graphs
• Longest paths and cycles in K1,3-free graphs
• Hamilton cycles in claw-free graphs
• K₄⁻‐factor in a graph
• Hamiltonian cycles in 2‐connected claw‐free‐graphs
• On the maximal number of independent circuits in a graph

This page was built for publication: Disjoint cliques in claw-free graphs