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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.11.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055226951 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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