Vertex-disjoint copies of specified subgraphs of order four in claw-free graphs

zbMATH Open1374.05138MaRDI QIDQ5276341FDOQ5276341

Authors: Liyan Ma, Haijuan Zhou, Yunshu Gao 

Publication date: 14 July 2017

Recommendations

• Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five
• Disjoint \(K_{1, 4}\) in claw-free graphs with minimum degree at least four
• Vertex-disjoint copies of \(K_{1}+(K_{1} \cup K_{2}\)) in claw-free graphs
• Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs
• Vertex-disjoint \({K_1+(K_1\cup K_2)}\) in \(K_{1,4}\)-free graphs with minimum degree at least four

zbMATH Keywords

claw-free graphsdegree conditionvertex-disjoint

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (5)

• Vertex-disjoint copies of \(K_{1}+(K_{1} \cup K_{2}\)) in claw-free graphs
• Disjoint \(K_{1, 4}\) in claw-free graphs with minimum degree at least four
• Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five
• Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs
• Title not available (Why is that?)

This page was built for publication: Vertex-disjoint copies of specified subgraphs of order four in claw-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5276341)