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

MaRDI QIDQ5276341zbMATH OpenFDO

Authors Liyan Ma, Haijuan Zhou, Yunshu Gao

Publication date 14 July 2017

zbMATH Keywords

claw-free graphsdegree conditionvertex-disjoint

Mathematics Subject Classification ID

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

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

Cited in

(5)

• Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five
• 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
• Disjoint \(K_{1, 4}\) in claw-free graphs with minimum degree at least four
• scientific article; zbMATH DE number 2147939 (Why is no real title available?)

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)