\(K_{1,3}\)-factors in graphs (Q998329): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the maximal number of independent circuits in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint claws in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circuits in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3211348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / 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: Proof of the Alon-Yuster conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: An El-Zah�r type condition ensuring path-factors / rank
 
Normal rank

Latest revision as of 01:05, 29 June 2024

scientific article
Language Label Description Also known as
English
\(K_{1,3}\)-factors in graphs
scientific article

    Statements

    \(K_{1,3}\)-factors in graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 January 2009
    0 references
    0 references
    claw
    0 references
    vertex-disjoint subgraphs
    0 references
    factor
    0 references
    minimum degree
    0 references
    0 references