Disjoint K₁, 4 in claw-free graphs with minimum degree at least four

zbMATH Open1383.05168MaRDI QIDQ4604124FDOQ4604124

Yunshu Gao, Haijuan Zhou

Publication date: 23 February 2018

Recommendations

• Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five
• Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs
• Vertex-disjoint copies of \(K_{1}+(K_{1} \cup K_{2}\)) in claw-free graphs
• Vertex-disjoint copies of specified subgraphs of order four 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

minimum degreevertex-disjoint subgraphsforbidden graphs

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

• Vertex-disjoint copies of \(K_{1}+(K_{1} \cup K_{2}\)) in claw-free graphs
• The independence number of connected (claw, \(K_4\))-free 4-regular graphs
• Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five
• Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs
• Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\)
• Title not available (Why is that?)

This page was built for publication: Disjoint \(K_{1, 4}\) in claw-free graphs with minimum degree at least four

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