Disjoint K₄^- in claw-free graphs with minimum degree at least five
From MaRDI portal
Publication:2258124
Recommendations
- Disjoint \(K_{1, 4}\) in claw-free graphs with minimum degree at least four
- 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}\)
- Disjoint cliques in claw-free graphs
- Vertex-disjoint copies of specified subgraphs of order four in claw-free graphs
- Minimum degree and disjoint cycles 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
- Minimum degree and disjoint cycles in generalized claw-free graphs
- The independence number of connected (claw, K₄)-free 4-regular graphs
- On factors of 4-connected claw-free graphs
Cites work
- K4−‐factor in a graph
- Disjoint stars and forbidden subgraphs
- Graph theory
- scientific article; zbMATH DE number 2188394 (Why is no real title available?)
- Vertex-disjoint copies of \(K_{1}+(K_{1} \cup K_{2}\)) in claw-free graphs
- Vertex-disjoint triangles in \(K_{1,t}\)-free graphs with minimum degree at least \(t\)
- Vertex-disjoint triangles in claw-free graphs with minimum degree at least three
Cited in
(7)- Vertex-disjoint triangles in claw-free graphs with minimum degree at least three
- The independence number of connected (claw, K₄)-free 4-regular graphs
- Vertex-disjoint \({K_1+(K_1\cup K_2)}\) in \(K_{1,4}\)-free graphs with minimum degree at least four
- 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
- Vertex-disjoint copies of specified subgraphs of order four in claw-free graphs
- Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\)
This page was built for publication: Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2258124)
