Upper bounds for the paired-domination numbers of graphs (Q2631089): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Labelling algorithms for paired-domination problems in block and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper paired-domination in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in claw-free cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of cubic graphs with paired-domination number three-fifths their order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with large paired-domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in claw-free graphs with minimum degree at least three / rank
 
Normal rank

Latest revision as of 08:13, 12 July 2024

scientific article
Language Label Description Also known as
English
Upper bounds for the paired-domination numbers of graphs
scientific article

    Statements

    Identifiers