Perfect matchings in paired domination vertex critical graphs (Q437060): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Vertex domination-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicritical domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex domination‐critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of total domination vertex critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of paired-domination vertex critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired domination vertex critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching properties in total domination vertex critical graphs / rank
 
Normal rank

Latest revision as of 12:08, 5 July 2024

scientific article
Language Label Description Also known as
English
Perfect matchings in paired domination vertex critical graphs
scientific article

    Statements

    Perfect matchings in paired domination vertex critical graphs (English)
    0 references
    0 references
    0 references
    0 references
    17 July 2012
    0 references
    0 references
    matching
    0 references
    perfect matching
    0 references
    factor-critical
    0 references
    paired domination vertex critical
    0 references
    0 references