Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five (Q2258124): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint stars and forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint copies of \(K_{1}+(K_{1} \cup K_{2}\)) in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>K</i><sub>4</sub><sup>−</sup>‐factor in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint triangles in claw-free graphs with minimum degree at least three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint triangles in \(K_{1,t}\)-free graphs with minimum degree at least \(t\) / rank
 
Normal rank

Latest revision as of 19:14, 9 July 2024

scientific article
Language Label Description Also known as
English
Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five
scientific article

    Statements

    Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five (English)
    0 references
    0 references
    0 references
    2 March 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    forbidden graph
    0 references
    vertex-disjoint subgraph
    0 references
    minimum degree
    0 references
    0 references